:: WAYBEL13 semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem Th1: :: WAYBEL13:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th2: :: WAYBEL13:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th3: :: WAYBEL13:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th4: :: WAYBEL13:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th5: :: WAYBEL13:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th6: :: WAYBEL13:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th7: :: WAYBEL13:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th8: :: WAYBEL13:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th9: :: WAYBEL13:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th10: :: WAYBEL13:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th11: :: WAYBEL13:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th12: :: WAYBEL13:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: WAYBEL13:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: WAYBEL13:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th15: :: WAYBEL13:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th16: :: WAYBEL13:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: WAYBEL13:17
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th18: :: WAYBEL13:18
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th19: :: WAYBEL13:19
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th20: :: WAYBEL13:20
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th21: :: WAYBEL13:21
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th22: :: WAYBEL13:22
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th23: :: WAYBEL13:23
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm1:
for L1, L2 being non empty RelStr
for f being Function of L1,L2 st f is sups-preserving holds
f is directed-sups-preserving
theorem Th24: :: WAYBEL13:24
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: WAYBEL13:25
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm2:
for L being lower-bounded LATTICE st L is algebraic holds
ex X being non empty set ex S being full SubRelStr of BoolePoset X st
( S is infs-inheriting & S is directed-sups-inheriting & L,S are_isomorphic )
theorem Th26: :: WAYBEL13:26
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm3:
for L being LATTICE st ex X being non empty set ex S being full SubRelStr of BoolePoset X st
( S is infs-inheriting & S is directed-sups-inheriting & L,S are_isomorphic ) holds
ex X being non empty set ex c being closure Function of (BoolePoset X),(BoolePoset X) st
( c is directed-sups-preserving & L, Image c are_isomorphic )
Lm4:
for L being LATTICE st ex X being set ex S being full SubRelStr of BoolePoset X st
( S is infs-inheriting & S is directed-sups-inheriting & L,S are_isomorphic ) holds
ex X being set ex c being closure Function of (BoolePoset X),(BoolePoset X) st
( c is directed-sups-preserving & L, Image c are_isomorphic )
Lm5:
for L1, L2 being non empty up-complete Poset
for f being Function of L1,L2 st f is isomorphic holds
for x, y being Element of L1 st x << y holds
f . x << f . y
theorem Th27: :: WAYBEL13:27
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th28: :: WAYBEL13:28
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th29: :: WAYBEL13:29
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th30: :: WAYBEL13:30
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th31: :: WAYBEL13:31
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th32: :: WAYBEL13:32
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm6:
for L being LATTICE st ex X being set ex c being closure Function of (BoolePoset X),(BoolePoset X) st
( c is directed-sups-preserving & L, Image c are_isomorphic ) holds
L is algebraic
theorem :: WAYBEL13:33
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: WAYBEL13:34
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: WAYBEL13:35
:: Showing IDV graph ... (Click the Palm Tree again to close it) 