:: WAYBEL26 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
:: deftheorem defines oContMaps WAYBEL26:def 1 :
theorem Th1: :: WAYBEL26:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th2: :: WAYBEL26:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th3: :: WAYBEL26:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: WAYBEL26:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: WAYBEL26:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: WAYBEL26:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let X,
Y,
Z be non
empty TopSpace;
let f be
continuous Function of
Y,
Z;
func oContMaps X,
f -> Function of
(oContMaps X,Y),
(oContMaps X,Z) means :
Def2:
:: WAYBEL26:def 2
for
g being
continuous Function of
X,
Y holds
it . g = f * g;
uniqueness
for b1, b2 being Function of (oContMaps X,Y),(oContMaps X,Z) st ( for g being continuous Function of X,Y holds b1 . g = f * g ) & ( for g being continuous Function of X,Y holds b2 . g = f * g ) holds
b1 = b2
existence
ex b1 being Function of (oContMaps X,Y),(oContMaps X,Z) st
for g being continuous Function of X,Y holds b1 . g = f * g
func oContMaps f,
X -> Function of
(oContMaps Z,X),
(oContMaps Y,X) means :
Def3:
:: WAYBEL26:def 3
for
g being
continuous Function of
Z,
X holds
it . g = g * f;
uniqueness
for b1, b2 being Function of (oContMaps Z,X),(oContMaps Y,X) st ( for g being continuous Function of Z,X holds b1 . g = g * f ) & ( for g being continuous Function of Z,X holds b2 . g = g * f ) holds
b1 = b2
existence
ex b1 being Function of (oContMaps Z,X),(oContMaps Y,X) st
for g being continuous Function of Z,X holds b1 . g = g * f
end;
:: deftheorem Def2 defines oContMaps WAYBEL26:def 2 :
:: deftheorem Def3 defines oContMaps WAYBEL26:def 3 :
theorem Th7: :: WAYBEL26:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: WAYBEL26:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: WAYBEL26:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL26:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: WAYBEL26:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: WAYBEL26:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: WAYBEL26:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: WAYBEL26:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: WAYBEL26:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: WAYBEL26:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: WAYBEL26:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: WAYBEL26:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm1:
for Z being monotone-convergence T_0-TopSpace
for Y being non empty SubSpace of Z
for f being continuous Function of Z,Y st f is_a_retraction holds
Y is monotone-convergence
theorem Th19: :: WAYBEL26:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th20: :: WAYBEL26:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: WAYBEL26:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th22: :: WAYBEL26:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: WAYBEL26:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: WAYBEL26:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: WAYBEL26:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th26: :: WAYBEL26:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: WAYBEL26:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: WAYBEL26:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: WAYBEL26:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: WAYBEL26:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: WAYBEL26:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th32: :: WAYBEL26:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: WAYBEL26:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th34: :: WAYBEL26:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: WAYBEL26:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th36: :: WAYBEL26:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th37: :: WAYBEL26:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL26:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines *graph WAYBEL26:def 4 :
theorem Th39: :: WAYBEL26:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th40: :: WAYBEL26:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th41: :: WAYBEL26:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def5 defines *graph WAYBEL26:def 5 :
theorem Th42: :: WAYBEL26:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th43: :: WAYBEL26:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th44: :: WAYBEL26:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th45: :: WAYBEL26:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL26:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)