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

Theorem enpr2d 6996
Description: A pair with distinct elements is equinumerous to ordinal two. (Contributed by Rohan Ridenour, 3-Aug-2023.)
Hypotheses
Ref Expression
enpr2d.1  |-  ( ph  ->  A  e.  C )
enpr2d.2  |-  ( ph  ->  B  e.  D )
enpr2d.3  |-  ( ph  ->  -.  A  =  B )
Assertion
Ref Expression
enpr2d  |-  ( ph  ->  { A ,  B }  ~~  2o )

Proof of Theorem enpr2d
StepHypRef Expression
1 enpr2d.1 . . . . 5  |-  ( ph  ->  A  e.  C )
2 ensn1g 6970 . . . . 5  |-  ( A  e.  C  ->  { A }  ~~  1o )
31, 2syl 14 . . . 4  |-  ( ph  ->  { A }  ~~  1o )
4 enpr2d.2 . . . . 5  |-  ( ph  ->  B  e.  D )
5 1on 6588 . . . . 5  |-  1o  e.  On
6 en2sn 6987 . . . . 5  |-  ( ( B  e.  D  /\  1o  e.  On )  ->  { B }  ~~  { 1o } )
74, 5, 6sylancl 413 . . . 4  |-  ( ph  ->  { B }  ~~  { 1o } )
8 enpr2d.3 . . . . . 6  |-  ( ph  ->  -.  A  =  B )
98neqned 2409 . . . . 5  |-  ( ph  ->  A  =/=  B )
10 disjsn2 3732 . . . . 5  |-  ( A  =/=  B  ->  ( { A }  i^i  { B } )  =  (/) )
119, 10syl 14 . . . 4  |-  ( ph  ->  ( { A }  i^i  { B } )  =  (/) )
125onirri 4641 . . . . . 6  |-  -.  1o  e.  1o
1312a1i 9 . . . . 5  |-  ( ph  ->  -.  1o  e.  1o )
14 disjsn 3731 . . . . 5  |-  ( ( 1o  i^i  { 1o } )  =  (/)  <->  -.  1o  e.  1o )
1513, 14sylibr 134 . . . 4  |-  ( ph  ->  ( 1o  i^i  { 1o } )  =  (/) )
16 unen 6990 . . . 4  |-  ( ( ( { A }  ~~  1o  /\  { B }  ~~  { 1o }
)  /\  ( ( { A }  i^i  { B } )  =  (/)  /\  ( 1o  i^i  { 1o } )  =  (/) ) )  ->  ( { A }  u.  { B } )  ~~  ( 1o  u.  { 1o }
) )
173, 7, 11, 15, 16syl22anc 1274 . . 3  |-  ( ph  ->  ( { A }  u.  { B } ) 
~~  ( 1o  u.  { 1o } ) )
18 df-pr 3676 . . 3  |-  { A ,  B }  =  ( { A }  u.  { B } )
19 df-suc 4468 . . 3  |-  suc  1o  =  ( 1o  u.  { 1o } )
2017, 18, 193brtr4g 4122 . 2  |-  ( ph  ->  { A ,  B }  ~~  suc  1o )
21 df-2o 6582 . 2  |-  2o  =  suc  1o
2220, 21breqtrrdi 4130 1  |-  ( ph  ->  { A ,  B }  ~~  2o )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1397    e. wcel 2202    =/= wne 2402    u. cun 3198    i^i cin 3199   (/)c0 3494   {csn 3669   {cpr 3670   class class class wbr 4088   Oncon0 4460   suc csuc 4462   1oc1o 6574   2oc2o 6575    ~~ cen 6906
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-1o 6581  df-2o 6582  df-er 6701  df-en 6909
This theorem is referenced by:  isnzr2  14197
  Copyright terms: Public domain W3C validator