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

Theorem pr2cv1 7541
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 6702 . . . 4  |-  2o  =  { (/) ,  1o }
2 ensym 7068 . . . 4  |-  ( { A ,  B }  ~~  2o  ->  2o  ~~  { A ,  B }
)
31, 2eqbrtrrid 4166 . . 3  |-  ( { A ,  B }  ~~  2o  ->  { (/) ,  1o }  ~~  { A ,  B } )
4 bren 7030 . . 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 2824 . . . . . . 7  |-  f  e. 
_V
7 0ex 4260 . . . . . . 7  |-  (/)  e.  _V
86, 7fvex 5715 . . . . . 6  |-  ( f `
 (/) )  e.  _V
9 eleq1 2301 . . . . . 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 6695 . . . . . . . 8  |-  1o  e.  _V
136, 12fvex 5715 . . . . . . 7  |-  ( f `
 1o )  e. 
_V
14 eleq1 2301 . . . . . . 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 533 . . . . . . . 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 2274 . . . . . . 7  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  ( f `  (/) )  =  ( f `  1o ) )
20 f1of1 5638 . . . . . . . . 9  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  f : { (/) ,  1o } -1-1-> { A ,  B } )
2120ad2antrr 492 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  f : { (/) ,  1o } -1-1-> { A ,  B }
)
227prid1 3817 . . . . . . . . 9  |-  (/)  e.  { (/)
,  1o }
2322a1i 9 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  (/)  e.  { (/)
,  1o } )
2412prid2 3818 . . . . . . . . 9  |-  1o  e.  {
(/) ,  1o }
2524a1i 9 . . . . . . . 8  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  1o  e.  {
(/) ,  1o } )
26 f1veqaeq 5975 . . . . . . . 8  |-  ( ( f : { (/) ,  1o } -1-1-> { A ,  B }  /\  ( (/) 
e.  { (/) ,  1o }  /\  1o  e.  { (/)
,  1o } ) )  ->  ( (
f `  (/) )  =  ( f `  1o )  ->  (/)  =  1o ) )
2721, 23, 25, 26syl12anc 1276 . . . . . . 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 6705 . . . . . . . 8  |-  1o  =/=  (/)
3029nesymi 2466 . . . . . . 7  |-  -.  (/)  =  1o
3130a1i 9 . . . . . 6  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  -.  (/)  =  1o )
3228, 31pm2.21dd 629 . . . . 5  |-  ( ( ( f : { (/)
,  1o } -1-1-onto-> { A ,  B }  /\  ( f `  (/) )  =  B )  /\  ( f `  1o )  =  B
)  ->  A  e.  _V )
33 f1of 5639 . . . . . . . 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 5844 . . . . . . 7  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( f `  1o )  e.  { A ,  B } )
36 elpri 3732 . . . . . . 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 810 . . . 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 5844 . . . . 5  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  ( f `  (/) )  e. 
{ A ,  B } )
42 elpri 3732 . . . . 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 810 . . 3  |-  ( f : { (/) ,  1o }
-1-1-onto-> { A ,  B }  ->  A  e.  _V )
4544exlimiv 1651 . 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
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 720    = wceq 1402   E.wex 1545    e. wcel 2209   _Vcvv 2821   (/)c0 3520   {cpr 3710   class class class wbr 4130   -1-1->wf1 5374   -1-1-onto->wf1o 5376   ` cfv 5377   1oc1o 6680   2oc2o 6681    ~~ cen 7020
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-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  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-1o 6687  df-2o 6688  df-er 6807  df-en 7023
This theorem is used by:  pr2cv2  7542  pr2cv  7543
  Copyright terms: Public domain W3C validator