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

Theorem pr2cv1 7391
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 6592 . . . 4  |-  2o  =  { (/) ,  1o }
2 ensym 6950 . . . 4  |-  ( { A ,  B }  ~~  2o  ->  2o  ~~  { A ,  B }
)
31, 2eqbrtrrid 4122 . . 3  |-  ( { A ,  B }  ~~  2o  ->  { (/) ,  1o }  ~~  { A ,  B } )
4 bren 6912 . . 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 2803 . . . . . . 7  |-  f  e. 
_V
7 0ex 4214 . . . . . . 7  |-  (/)  e.  _V
86, 7fvex 5655 . . . . . 6  |-  ( f `
 (/) )  e.  _V
9 eleq1 2292 . . . . . 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 6585 . . . . . . . 8  |-  1o  e.  _V
136, 12fvex 5655 . . . . . . 7  |-  ( f `
 1o )  e. 
_V
14 eleq1 2292 . . . . . . 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 528 . . . . . . . 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 2265 . . . . . . 7  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  ( f `  (/) )  =  ( f `  1o ) )
20 f1of1 5579 . . . . . . . . 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 3775 . . . . . . . . 9  |-  (/)  e.  { (/)
,  1o }
2322a1i 9 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  (/)  e.  { (/)
,  1o } )
2412prid2 3776 . . . . . . . . 9  |-  1o  e.  {
(/) ,  1o }
2524a1i 9 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  1o  e.  {
(/) ,  1o } )
26 f1veqaeq 5905 . . . . . . . 8  |-  ( ( f : { (/) ,  1o } -1-1-> { A ,  B }  /\  ( (/) 
e.  { (/) ,  1o }  /\  1o  e.  { (/)
,  1o } ) )  ->  ( (
f `  (/) )  =  ( f `  1o )  ->  (/)  =  1o ) )
2721, 23, 25, 26syl12anc 1269 . . . . . . 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 6595 . . . . . . . 8  |-  1o  =/=  (/)
3029nesymi 2446 . . . . . . 7  |-  -.  (/)  =  1o
3130a1i 9 . . . . . 6  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  -.  (/)  =  1o )
3228, 31pm2.21dd 623 . . . . 5  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  A  e.  _V )
33 f1of 5580 . . . . . . . 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 5779 . . . . . . 7  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( f `  1o )  e.  { A ,  B } )
36 elpri 3690 . . . . . . 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 803 . . . 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 5779 . . . . 5  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( f `  (/) )  e. 
{ A ,  B } )
42 elpri 3690 . . . . 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 803 . . 3  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  A  e.  _V )
4544exlimiv 1644 . 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 713    = wceq 1395   E.wex 1538    e. wcel 2200   _Vcvv 2800   (/)c0 3492   {cpr 3668   class class class wbr 4086   -1-1->wf1 5321   -1-1-onto->wf1o 5323   ` cfv 5324   1oc1o 6570   2oc2o 6571    ~~ cen 6902
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-1o 6577  df-2o 6578  df-er 6697  df-en 6905
This theorem is referenced by:  pr2cv2  7392  pr2cv  7393
  Copyright terms: Public domain W3C validator