:: GOBRD12 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
for f being non constant standard special_circular_sequence holds (L~ f) ` = the carrier of ((TOP-REAL 2) | ((L~ f) ` ))
Lm2:
the carrier of (TOP-REAL 2) = REAL 2
by EUCLID:25;
theorem :: GOBRD12:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th2: :: GOBRD12:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th3: :: GOBRD12:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: GOBRD12:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm3:
for f being non constant standard special_circular_sequence holds
( Cl (Down (LeftComp f),((L~ f) ` )) is connected & Down (LeftComp f),((L~ f) ` ) = LeftComp f & Down (LeftComp f),((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` ) )
Lm4:
for f being non constant standard special_circular_sequence holds
( Cl (Down (RightComp f),((L~ f) ` )) is connected & Down (RightComp f),((L~ f) ` ) = RightComp f & Down (RightComp f),((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` ) )
theorem Th5: :: GOBRD12:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: GOBRD12:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm5:
for f being non constant standard special_circular_sequence
for i1, j1, i2, j2 being Nat st i1 <= len (GoB f) & j1 <= width (GoB f) & i2 <= len (GoB f) & j2 <= width (GoB f) & ( i2 = i1 + 1 or i1 = i2 + 1 ) & j1 = j2 & Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f) holds
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
Lm6:
for f being non constant standard special_circular_sequence
for i1, j1, i2, j2 being Nat st i1 <= len (GoB f) & j1 <= width (GoB f) & i2 <= len (GoB f) & j2 <= width (GoB f) & ( j2 = j1 + 1 or j1 = j2 + 1 ) & i1 = i2 & Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f) holds
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
theorem Th7: :: GOBRD12:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
f being non
constant standard special_circular_sequence for
i1,
j1,
i2,
j2 being
Nat st
i1 <= len (GoB f) &
j1 <= width (GoB f) &
i2 <= len (GoB f) &
j2 <= width (GoB f) &
i1,
j1,
i2,
j2 are_adjacent2 holds
(
Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f) iff
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f) )
theorem Th8: :: GOBRD12:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
f being non
constant standard special_circular_sequence for
F1,
F2 being
FinSequence of
NAT st
len F1 = len F2 & ex
i being
Nat st
(
i in dom F1 &
Int (cell (GoB f),(F1 /. i),(F2 /. i)) c= (LeftComp f) \/ (RightComp f) ) & ( for
i being
Nat st 1
<= i &
i < len F1 holds
F1 /. i,
F2 /. i,
F1 /. (i + 1),
F2 /. (i + 1) are_adjacent2 ) & ( for
i,
k1,
k2 being
Nat st
i in dom F1 &
k1 = F1 . i &
k2 = F2 . i holds
(
k1 <= len (GoB f) &
k2 <= width (GoB f) ) ) holds
for
i being
Nat st
i in dom F1 holds
Int (cell (GoB f),(F1 /. i),(F2 /. i)) c= (LeftComp f) \/ (RightComp f)
theorem Th9: :: GOBRD12:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: GOBRD12:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD12:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)