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

Theorem restopnb 13348
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 1005 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  B )
2 simpr2 1004 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  B  C_  A )
31, 2sstrd 3165 . . . . . 6  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  A )
4 df-ss 3142 . . . . . 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 2183 . . . 4  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  =  ( C  i^i  A ) )
7 ineq1 3329 . . . . . 6  |-  ( v  =  C  ->  (
v  i^i  A )  =  ( C  i^i  A ) )
87rspceeqv 2859 . . . . 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 3345 . . . . . 6  |-  ( ( v  i^i  A )  i^i  B )  =  ( v  i^i  ( A  i^i  B ) )
12 simprr 531 . . . . . . . 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 3335 . . . . . . 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 1041 . . . . . . . . 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 3142 . . . . . . . . 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 2212 . . . . . 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 1040 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  B  C_  A )
20 sseqin2 3354 . . . . . . . . 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 3336 . . . . . . 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 2234 . . . . 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 533 . . . . . 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 529 . . . . . 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 1039 . . . . . 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 13168 . . . . . 6  |-  ( ( J  e.  Top  /\  v  e.  J  /\  B  e.  J )  ->  ( v  i^i  B
)  e.  J )
2925, 26, 27, 28syl3anc 1238 . . . . 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 2254 . . . 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 2595 . . 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 12643 . . 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 978    = wceq 1353    e. wcel 2148   E.wrex 2456    i^i cin 3128    C_ wss 3129  (class class class)co 5869   ↾t crest 12636   Topctop 13162
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-rest 12638  df-top 13163
This theorem is referenced by:  restopn2  13350
  Copyright terms: Public domain W3C validator