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

Theorem enpr2d 7077
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 7050 . . . . 5  |-  ( A  e.  C  ->  { A }  ~~  1o )
31, 2syl 14 . . . 4  |-  ( ph  ->  { A }  ~~  1o )
4 enpr2d.2 . . . . 5  |-  ( ph  ->  B  e.  D )
5 1on 6667 . . . . 5  |-  1o  e.  On
6 en2sn 7068 . . . . 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 2421 . . . . 5  |-  ( ph  ->  A  =/=  B )
10 disjsn2 3757 . . . . 5  |-  ( A  =/=  B  ->  ( { A }  i^i  { B } )  =  (/) )
119, 10syl 14 . . . 4  |-  ( ph  ->  ( { A }  i^i  { B } )  =  (/) )
125onirri 4670 . . . . . 6  |-  -.  1o  e.  1o
1312a1i 9 . . . . 5  |-  ( ph  ->  -.  1o  e.  1o )
14 disjsn 3756 . . . . 5  |-  ( ( 1o  i^i  { 1o } )  =  (/)  <->  -.  1o  e.  1o )
1513, 14sylibr 134 . . . 4  |-  ( ph  ->  ( 1o  i^i  { 1o } )  =  (/) )
16 unen 7071 . . . 4  |-  ( ( ( { A }  ~~  1o  /\  { B }  ~~  { 1o }
)  /\  ( ( { A }  i^i  { B } )  =  (/)  /\  ( 1o  i^i  { 1o } )  =  (/) ) )  ->  ( { A }  u.  { B } )  ~~  ( 1o  u.  { 1o }
) )
173, 7, 11, 15, 16syl22anc 1275 . . 3  |-  ( ph  ->  ( { A }  u.  { B } ) 
~~  ( 1o  u.  { 1o } ) )
18 df-pr 3701 . . 3  |-  { A ,  B }  =  ( { A }  u.  { B } )
19 df-suc 4497 . . 3  |-  suc  1o  =  ( 1o  u.  { 1o } )
2017, 18, 193brtr4g 4148 . 2  |-  ( ph  ->  { A ,  B }  ~~  suc  1o )
21 df-2o 6661 . 2  |-  2o  =  suc  1o
2220, 21breqtrrdi 4156 1  |-  ( ph  ->  { A ,  B }  ~~  2o )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1398    e. wcel 2205    =/= wne 2414    u. cun 3212    i^i cin 3213   (/)c0 3512   {csn 3694   {cpr 3695   class class class wbr 4114   Oncon0 4489   suc csuc 4491   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  ax-setind 4664
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  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-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-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-1o 6660  df-2o 6661  df-er 6780  df-en 6989
This theorem is referenced by:  isnzr2  14429
  Copyright terms: Public domain W3C validator