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

Theorem restopnb 14768
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 1008 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  B )
2 simpr2 1007 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  B  C_  A )
31, 2sstrd 3211 . . . . . 6  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  C_  A )
4 df-ss 3187 . . . . . 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 2213 . . . 4  |-  ( ( ( J  e.  Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B
) )  ->  C  =  ( C  i^i  A ) )
7 ineq1 3375 . . . . . 6  |-  ( v  =  C  ->  (
v  i^i  A )  =  ( C  i^i  A ) )
87rspceeqv 2902 . . . . 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 3391 . . . . . 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 3381 . . . . . . 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 1044 . . . . . . . . 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 3187 . . . . . . . . 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 2242 . . . . . 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 1043 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  A  e.  V )  /\  ( B  e.  J  /\  B  C_  A  /\  C  C_  B ) )  /\  v  e.  J )  ->  B  C_  A )
20 sseqin2 3400 . . . . . . . . 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 3382 . . . . . . 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 2264 . . . . 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 1042 . . . . . 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 14590 . . . . . 6  |-  ( ( J  e.  Top  /\  v  e.  J  /\  B  e.  J )  ->  ( v  i^i  B
)  e.  J )
2925, 26, 27, 28syl3anc 1250 . . . . 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 2284 . . . 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 2626 . . 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 13193 . . 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 981    = wceq 1373    e. wcel 2178   E.wrex 2487    i^i cin 3173    C_ wss 3174  (class class class)co 5967   ↾t crest 13186   Topctop 14584
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-rest 13188  df-top 14585
This theorem is referenced by:  restopn2  14770
  Copyright terms: Public domain W3C validator