MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tskmcl Structured version   Visualization version   Unicode version

Theorem tskmcl 9663
Description: A Tarski class that contains  A is a Tarski class. (Contributed by FL, 17-Apr-2011.) (Proof shortened by Mario Carneiro, 21-Sep-2014.)
Assertion
Ref Expression
tskmcl  |-  ( tarskiMap `  A )  e.  Tarski

Proof of Theorem tskmcl
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 tskmval 9661 . . 3  |-  ( A  e.  _V  ->  ( tarskiMap `  A )  =  |^| { x  e.  Tarski  |  A  e.  x } )
2 ssrab2 3687 . . . 4  |-  { x  e.  Tarski  |  A  e.  x }  C_  Tarski
3 id 22 . . . . . . 7  |-  ( A  e.  _V  ->  A  e.  _V )
4 grothtsk 9657 . . . . . . 7  |-  U. Tarski  =  _V
53, 4syl6eleqr 2712 . . . . . 6  |-  ( A  e.  _V  ->  A  e.  U. Tarski )
6 eluni2 4440 . . . . . 6  |-  ( A  e.  U. Tarski  <->  E. x  e.  Tarski  A  e.  x
)
75, 6sylib 208 . . . . 5  |-  ( A  e.  _V  ->  E. x  e.  Tarski  A  e.  x
)
8 rabn0 3958 . . . . 5  |-  ( { x  e.  Tarski  |  A  e.  x }  =/=  (/)  <->  E. x  e.  Tarski  A  e.  x
)
97, 8sylibr 224 . . . 4  |-  ( A  e.  _V  ->  { x  e.  Tarski  |  A  e.  x }  =/=  (/) )
10 inttsk 9596 . . . 4  |-  ( ( { x  e.  Tarski  |  A  e.  x }  C_ 
Tarski  /\  { x  e. 
Tarski  |  A  e.  x }  =/=  (/) )  ->  |^| { x  e.  Tarski  |  A  e.  x }  e.  Tarski )
112, 9, 10sylancr 695 . . 3  |-  ( A  e.  _V  ->  |^| { x  e.  Tarski  |  A  e.  x }  e.  Tarski )
121, 11eqeltrd 2701 . 2  |-  ( A  e.  _V  ->  ( tarskiMap `  A )  e.  Tarski )
13 fvprc 6185 . . 3  |-  ( -.  A  e.  _V  ->  (
tarskiMap `
 A )  =  (/) )
14 0tsk 9577 . . 3  |-  (/)  e.  Tarski
1513, 14syl6eqel 2709 . 2  |-  ( -.  A  e.  _V  ->  (
tarskiMap `
 A )  e. 
Tarski )
1612, 15pm2.61i 176 1  |-  ( tarskiMap `  A )  e.  Tarski
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    e. wcel 1990    =/= wne 2794   E.wrex 2913   {crab 2916   _Vcvv 3200    C_ wss 3574   (/)c0 3915   U.cuni 4436   |^|cint 4475   ` cfv 5888   Tarskictsk 9570   tarskiMapctskm 9659
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-groth 9645
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-int 4476  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-er 7742  df-en 7956  df-dom 7957  df-tsk 9571  df-tskm 9660
This theorem is referenced by:  eltskm  9665
  Copyright terms: Public domain W3C validator