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

Theorem restopnb 14349
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 1007 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  B )
2 simpr2 1006 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  B  C_  A )
31, 2sstrd 3189 . . . . . 6  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  A )
4 df-ss 3166 . . . . . 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 2199 . . . 4  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  =  ( C  i^i  A ) )
7 ineq1 3353 . . . . . 6  |-  ( v  =  C  ->  (
v  i^i  A )  =  ( C  i^i  A ) )
87rspceeqv 2882 . . . . 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 3369 . . . . . 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 3359 . . . . . . 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 1043 . . . . . . . . 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 3166 . . . . . . . . 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 2228 . . . . . 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 1042 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  B  C_  A )
20 sseqin2 3378 . . . . . . . . 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 3360 . . . . . . 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 2250 . . . . 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 1041 . . . . . 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 14171 . . . . . 6  |-  ( ( J  e.  Top  /\  v  e.  J  /\  B  e.  J )  ->  ( v  i^i  B
)  e.  J )
2925, 26, 27, 28syl3anc 1249 . . . . 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 2270 . . . 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 2612 . . 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 12857 . . 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 980    = wceq 1364    e. wcel 2164   E.wrex 2473    i^i cin 3152    C_ wss 3153  (class class class)co 5918   ↾t crest 12850   Topctop 14165
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-rest 12852  df-top 14166
This theorem is referenced by:  restopn2  14351
  Copyright terms: Public domain W3C validator