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

Theorem pr2cv1 7505
Description: If an unordered pair is equinumerous to ordinal two, then a part is a set. (Contributed by RP, 21-Oct-2023.)
Assertion
Ref Expression
pr2cv1  |-  ( { A ,  B }  ~~  2o  ->  A  e.  _V )

Proof of Theorem pr2cv1
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 df2o3 6675 . . . 4  |-  2o  =  { (/) ,  1o }
2 ensym 7034 . . . 4  |-  ( { A ,  B }  ~~  2o  ->  2o  ~~  { A ,  B }
)
31, 2eqbrtrrid 4150 . . 3  |-  ( { A ,  B }  ~~  2o  ->  { (/) ,  1o }  ~~  { A ,  B } )
4 bren 6996 . . 3  |-  ( {
(/) ,  1o }  ~~  { A ,  B }  <->  E. f  f : { (/)
,  1o } -1-1-onto-> { A ,  B } )
53, 4sylib 122 . 2  |-  ( { A ,  B }  ~~  2o  ->  E. f 
f : { (/) ,  1o } -1-1-onto-> { A ,  B } )
6 vex 2818 . . . . . . 7  |-  f  e. 
_V
7 0ex 4242 . . . . . . 7  |-  (/)  e.  _V
86, 7fvex 5695 . . . . . 6  |-  ( f `
 (/) )  e.  _V
9 eleq1 2297 . . . . . 6  |-  ( ( f `  (/) )  =  A  ->  ( (
f `  (/) )  e. 
_V 
<->  A  e.  _V )
)
108, 9mpbii 148 . . . . 5  |-  ( ( f `  (/) )  =  A  ->  A  e.  _V )
1110adantl 277 . . . 4  |-  ( ( f : { (/) ,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  A )  ->  A  e.  _V )
12 1oex 6668 . . . . . . . 8  |-  1o  e.  _V
136, 12fvex 5695 . . . . . . 7  |-  ( f `
 1o )  e. 
_V
14 eleq1 2297 . . . . . . 7  |-  ( ( f `  1o )  =  A  ->  (
( f `  1o )  e.  _V  <->  A  e.  _V ) )
1513, 14mpbii 148 . . . . . 6  |-  ( ( f `  1o )  =  A  ->  A  e.  _V )
1615adantl 277 . . . . 5  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  A
)  ->  A  e.  _V )
17 simplr 529 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  ( f `  (/) )  =  B )
18 simpr 110 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  ( f `  1o )  =  B )
1917, 18eqtr4d 2270 . . . . . . 7  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  ( f `  (/) )  =  ( f `  1o ) )
20 f1of1 5618 . . . . . . . . 9  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  f : { (/) ,  1o } -1-1-> { A ,  B } )
2120ad2antrr 488 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  f : { (/) ,  1o } -1-1-> { A ,  B }
)
227prid1 3802 . . . . . . . . 9  |-  (/)  e.  { (/)
,  1o }
2322a1i 9 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  (/)  e.  { (/)
,  1o } )
2412prid2 3803 . . . . . . . . 9  |-  1o  e.  {
(/) ,  1o }
2524a1i 9 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  1o  e.  {
(/) ,  1o } )
26 f1veqaeq 5948 . . . . . . . 8  |-  ( ( f : { (/) ,  1o } -1-1-> { A ,  B }  /\  ( (/) 
e.  { (/) ,  1o }  /\  1o  e.  { (/)
,  1o } ) )  ->  ( (
f `  (/) )  =  ( f `  1o )  ->  (/)  =  1o ) )
2721, 23, 25, 26syl12anc 1272 . . . . . . 7  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  ( (
f `  (/) )  =  ( f `  1o )  ->  (/)  =  1o ) )
2819, 27mpd 13 . . . . . 6  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  (/)  =  1o )
29 1n0 6678 . . . . . . . 8  |-  1o  =/=  (/)
3029nesymi 2460 . . . . . . 7  |-  -.  (/)  =  1o
3130a1i 9 . . . . . 6  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  -.  (/)  =  1o )
3228, 31pm2.21dd 625 . . . . 5  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  A  e.  _V )
33 f1of 5619 . . . . . . . 8  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  f : { (/) ,  1o } --> { A ,  B } )
3424a1i 9 . . . . . . . 8  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  1o  e.  { (/) ,  1o } )
3533, 34ffvelcdmd 5818 . . . . . . 7  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( f `  1o )  e.  { A ,  B } )
36 elpri 3717 . . . . . . 7  |-  ( ( f `  1o )  e.  { A ,  B }  ->  ( ( f `  1o )  =  A  \/  (
f `  1o )  =  B ) )
3735, 36syl 14 . . . . . 6  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( ( f `  1o )  =  A  \/  ( f `  1o )  =  B )
)
3837adantr 276 . . . . 5  |-  ( ( f : { (/) ,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  ->  ( ( f `
 1o )  =  A  \/  ( f `
 1o )  =  B ) )
3916, 32, 38mpjaodan 806 . . . 4  |-  ( ( f : { (/) ,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  ->  A  e.  _V )
4022a1i 9 . . . . . 6  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  -> 
(/)  e.  { (/) ,  1o } )
4133, 40ffvelcdmd 5818 . . . . 5  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( f `  (/) )  e. 
{ A ,  B } )
42 elpri 3717 . . . . 5  |-  ( ( f `  (/) )  e. 
{ A ,  B }  ->  ( ( f `
 (/) )  =  A  \/  ( f `  (/) )  =  B ) )
4341, 42syl 14 . . . 4  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( ( f `  (/) )  =  A  \/  ( f `  (/) )  =  B ) )
4411, 39, 43mpjaodan 806 . . 3  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  A  e.  _V )
4544exlimiv 1647 . 2  |-  ( E. f  f : { (/)
,  1o } -1-1-onto-> { A ,  B }  ->  A  e.  _V )
465, 45syl 14 1  |-  ( { A ,  B }  ~~  2o  ->  A  e.  _V )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716    = wceq 1398   E.wex 1541    e. wcel 2205   _Vcvv 2815   (/)c0 3512   {cpr 3695   class class class wbr 4114   -1-1->wf1 5354   -1-1-onto->wf1o 5356   ` cfv 5357   1oc1o 6653   2oc2o 6654    ~~ cen 6986
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-1o 6660  df-2o 6661  df-er 6780  df-en 6989
This theorem is referenced by:  pr2cv2  7506  pr2cv  7507
  Copyright terms: Public domain W3C validator