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

Theorem restopnb 14904
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 1031 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  B )
2 simpr2 1030 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  B  C_  A )
31, 2sstrd 3237 . . . . . 6  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  A )
4 df-ss 3213 . . . . . 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 2237 . . . 4  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  =  ( C  i^i  A ) )
7 ineq1 3401 . . . . . 6  |-  ( v  =  C  ->  (
v  i^i  A )  =  ( C  i^i  A ) )
87rspceeqv 2928 . . . . 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 3417 . . . . . 6  |-  ( ( v  i^i  A )  i^i  B )  =  ( v  i^i  ( A  i^i  B ) )
12 simprr 533 . . . . . . . 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 3407 . . . . . . 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 1067 . . . . . . . . 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 3213 . . . . . . . . 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 479 . . . . . . 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 2266 . . . . . 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 1066 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  B  C_  A )
20 sseqin2 3426 . . . . . . . . 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 3408 . . . . . . 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 479 . . . . . 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 2288 . . . . 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 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 )
) )  ->  J  e.  Top )
26 simprl 531 . . . . . 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 1065 . . . . . 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 14726 . . . . . 6  |-  ( ( J  e.  Top  /\  v  e.  J  /\  B  e.  J )  ->  ( v  i^i  B
)  e.  J )
2925, 26, 27, 28syl3anc 1273 . . . . 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 2308 . . . 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 2651 . . 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 13328 . . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    = wceq 1397    e. wcel 2202   E.wrex 2511    i^i cin 3199    C_ wss 3200  (class class class)co 6017   ↾t crest 13321   Topctop 14720
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-rest 13323  df-top 14721
This theorem is referenced by:  restopn2  14906
  Copyright terms: Public domain W3C validator