:: REALSET3 semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem Th1: :: REALSET3:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th2: :: REALSET3:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th3: :: REALSET3:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th4: :: REALSET3:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th5: :: REALSET3:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th6: :: REALSET3:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th7: :: REALSET3:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th8: :: REALSET3:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
F being
Field for
a,
b being
Element of
suppf F for
c,
d being
Element of
(suppf F) \ {(ndf F)} holds
(odf F) . [((omf F) . [a,((revf F) . c)]),((omf F) . [b,((revf F) . d)])] = (omf F) . [((odf F) . [((omf F) . [a,d]),((omf F) . [b,c])]),((revf F) . ((omf F) . [c,d]))]
definition
let F be
Field;
func osf F -> BinOp of
suppf F means :
Def1:
:: REALSET3:def 1
for
x,
y being
Element of
suppf F holds
it . [x,y] = (odf F) . [x,((compf F) . y)];
existence
ex b1 being BinOp of suppf F st
for x, y being Element of suppf F holds b1 . [x,y] = (odf F) . [x,((compf F) . y)]
uniqueness
for b1, b2 being BinOp of suppf F st ( for x, y being Element of suppf F holds b1 . [x,y] = (odf F) . [x,((compf F) . y)] ) & ( for x, y being Element of suppf F holds b2 . [x,y] = (odf F) . [x,((compf F) . y)] ) holds
b1 = b2
end;
:: deftheorem Def1 defines osf REALSET3:def 1 :
theorem :: REALSET3:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: REALSET3:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: REALSET3:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th15: :: REALSET3:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th16: :: REALSET3:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:17
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:18
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:19
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th20: :: REALSET3:20
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:21
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th22: :: REALSET3:22
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:23
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:24
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:25
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:26
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
definition
let F be
Field;
func ovf F -> Function of
[:(suppf F),((suppf F) \ {(ndf F)}):],
suppf F means :
Def2:
:: REALSET3:def 2
for
x being
Element of
suppf F for
y being
Element of
(suppf F) \ {(ndf F)} holds
it . [x,y] = (omf F) . [x,((revf F) . y)];
existence
ex b1 being Function of [:(suppf F),((suppf F) \ {(ndf F)}):], suppf F st
for x being Element of suppf F
for y being Element of (suppf F) \ {(ndf F)} holds b1 . [x,y] = (omf F) . [x,((revf F) . y)]
uniqueness
for b1, b2 being Function of [:(suppf F),((suppf F) \ {(ndf F)}):], suppf F st ( for x being Element of suppf F
for y being Element of (suppf F) \ {(ndf F)} holds b1 . [x,y] = (omf F) . [x,((revf F) . y)] ) & ( for x being Element of suppf F
for y being Element of (suppf F) \ {(ndf F)} holds b2 . [x,y] = (omf F) . [x,((revf F) . y)] ) holds
b1 = b2
end;
:: deftheorem Def2 defines ovf REALSET3:def 2 :
theorem :: REALSET3:27
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: REALSET3:28
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem Th29: :: REALSET3:29
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th30: :: REALSET3:30
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th31: :: REALSET3:31
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:32
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:33
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: REALSET3:34
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem :: REALSET3:35
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:36
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th37: :: REALSET3:37
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:38
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th39: :: REALSET3:39
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:40
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:41
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:42
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: REALSET3:43
:: Showing IDV graph ... (Click the Palm Tree again to close it) 