ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  restopnb Unicode version

Theorem restopnb 15282
Description: If  B is an open subset of the subspace base set  A, then any subset of  B is open iff it is open in  A. (Contributed by Mario Carneiro, 2-Mar-2015.)
Assertion
Ref Expression
restopnb  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  ( C  e.  J  <->  C  e.  ( Jt  A ) ) )

Proof of Theorem restopnb
Dummy variable  v is distinct from all other variables.
StepHypRef Expression
1 simpr3 1036 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  B )
2 simpr2 1035 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  B  C_  A )
31, 2sstrd 3258 . . . . . 6  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  A )
4 df-ss 3233 . . . . . 6  |-  ( C 
C_  A  <->  ( C  i^i  A )  =  C )
53, 4sylib 122 . . . . 5  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  ( C  i^i  A )  =  C )
65eqcomd 2244 . . . 4  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  =  ( C  i^i  A ) )
7 ineq1 3425 . . . . . 6  |-  ( v  =  C  ->  (
v  i^i  A )  =  ( C  i^i  A ) )
87rspceeqv 2948 . . . . 5  |-  ( ( C  e.  J  /\  C  =  ( C  i^i  A ) )  ->  E. v  e.  J  C  =  ( v  i^i  A ) )
98expcom 116 . . . 4  |-  ( C  =  ( C  i^i  A )  ->  ( C  e.  J  ->  E. v  e.  J  C  =  ( v  i^i  A
) ) )
106, 9syl 14 . . 3  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  ( C  e.  J  ->  E. v  e.  J  C  =  ( v  i^i 
A ) ) )
11 inass 3441 . . . . . 6  |-  ( ( v  i^i  A )  i^i  B )  =  ( v  i^i  ( A  i^i  B ) )
12 simprr 537 . . . . . . . 8  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  C  =  ( v  i^i 
A ) )
1312ineq1d 3431 . . . . . . 7  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  ( C  i^i  B )  =  ( ( v  i^i 
A )  i^i  B
) )
14 simplr3 1072 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  C  C_  B )
15 df-ss 3233 . . . . . . . . 9  |-  ( C 
C_  B  <->  ( C  i^i  B )  =  C )
1614, 15sylib 122 . . . . . . . 8  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  ( C  i^i  B
)  =  C )
1716adantrr 483 . . . . . . 7  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  ( C  i^i  B )  =  C )
1813, 17eqtr3d 2273 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  (
( v  i^i  A
)  i^i  B )  =  C )
19 simplr2 1071 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  B  C_  A )
20 sseqin2 3450 . . . . . . . . 9  |-  ( B 
C_  A  <->  ( A  i^i  B )  =  B )
2119, 20sylib 122 . . . . . . . 8  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  ( A  i^i  B
)  =  B )
2221ineq2d 3432 . . . . . . 7  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  ( v  i^i  ( A  i^i  B ) )  =  ( v  i^i 
B ) )
2322adantrr 483 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  (
v  i^i  ( A  i^i  B ) )  =  ( v  i^i  B
) )
2411, 18, 233eqtr3a 2295 . . . . 5  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  C  =  ( v  i^i 
B ) )
25 simplll 539 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  J  e.  Top )
26 simprl 535 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  v  e.  J )
27 simplr1 1070 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  B  e.  J )
28 inopn 15104 . . . . . 6  |-  ( ( J  e.  Top  /\  v  e.  J  /\  B  e.  J )  ->  ( v  i^i  B
)  e.  J )
2925, 26, 27, 28syl3anc 1278 . . . . 5  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  (
v  i^i  B )  e.  J )
3024, 29eqeltrd 2315 . . . 4  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  ( v  e.  J  /\  C  =  (
v  i^i  A )
) )  ->  C  e.  J )
3130rexlimdvaa 2669 . . 3  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  ( E. v  e.  J  C  =  ( v  i^i  A )  ->  C  e.  J ) )
3210, 31impbid 129 . 2  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  ( C  e.  J  <->  E. v  e.  J  C  =  ( v  i^i  A
) ) )
33 elrest 13600 . . 3  |-  ( ( J  e.  Top  /\  A  e.  V )  ->  ( C  e.  ( Jt  A )  <->  E. v  e.  J  C  =  ( v  i^i  A
) ) )
3433adantr 276 . 2  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  ( C  e.  ( Jt  A
)  <->  E. v  e.  J  C  =  ( v  i^i  A ) ) )
3532, 34bitr4d 191 1  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  ( C  e.  J  <->  C  e.  ( Jt  A ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   E.wrex 2529    i^i cin 3219    C_ wss 3220  (class class class)co 6085   ↾t crest 13593   Topctop 15098
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-rest 13595  df-top 15099
This theorem is used by:  restopn2  15284
  Copyright terms: Public domain W3C validator