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

Theorem restid2 13602
Description: The subspace topology over a subset of the base set is the original topology. (Contributed by Mario Carneiro, 13-Aug-2015.)
Assertion
Ref Expression
restid2  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ( Jt  A )  =  J )

Proof of Theorem restid2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 pwexg 4317 . . . . 5  |-  ( A  e.  V  ->  ~P A  e.  _V )
21adantr 276 . . . 4  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ~P A  e. 
_V )
3 simpr 110 . . . 4  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  J  C_  ~P A )
42, 3ssexd 4273 . . 3  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  J  e.  _V )
5 simpl 109 . . 3  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  A  e.  V
)
6 restval 13599 . . 3  |-  ( ( J  e.  _V  /\  A  e.  V )  ->  ( Jt  A )  =  ran  ( x  e.  J  |->  ( x  i^i  A
) ) )
74, 5, 6syl2anc 415 . 2  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ( Jt  A )  =  ran  ( x  e.  J  |->  ( x  i^i  A ) ) )
83sselda 3248 . . . . . . . 8  |-  ( ( ( A  e.  V  /\  J  C_  ~P A
)  /\  x  e.  J )  ->  x  e.  ~P A )
98elpwid 3700 . . . . . . 7  |-  ( ( ( A  e.  V  /\  J  C_  ~P A
)  /\  x  e.  J )  ->  x  C_  A )
10 df-ss 3233 . . . . . . 7  |-  ( x 
C_  A  <->  ( x  i^i  A )  =  x )
119, 10sylib 122 . . . . . 6  |-  ( ( ( A  e.  V  /\  J  C_  ~P A
)  /\  x  e.  J )  ->  (
x  i^i  A )  =  x )
1211mpteq2dva 4221 . . . . 5  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ( x  e.  J  |->  ( x  i^i 
A ) )  =  ( x  e.  J  |->  x ) )
13 mptresid 5117 . . . . 5  |-  (  _I  |`  J )  =  ( x  e.  J  |->  x )
1412, 13eqtr4di 2289 . . . 4  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ( x  e.  J  |->  ( x  i^i 
A ) )  =  (  _I  |`  J ) )
1514rneqd 5011 . . 3  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ran  ( x  e.  J  |->  ( x  i^i  A ) )  =  ran  (  _I  |`  J ) )
16 rnresi 5144 . . 3  |-  ran  (  _I  |`  J )  =  J
1715, 16eqtrdi 2287 . 2  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ran  ( x  e.  J  |->  ( x  i^i  A ) )  =  J )
187, 17eqtrd 2271 1  |-  ( ( A  e.  V  /\  J  C_  ~P A )  ->  ( Jt  A )  =  J )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    i^i cin 3219    C_ wss 3220   ~Pcpw 3688    |-> cmpt 4192    _I cid 4433   ran crn 4775    |` cres 4776  (class class class)co 6085   ↾t crest 13593
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
This theorem is used by:  restid  13604  topnidg  13606
  Copyright terms: Public domain W3C validator