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

Theorem pr1or2 7504
Description: An unordered pair, with decidable equality for the specified elements, has either one or two elements. (Contributed by Jim Kingdon, 7-Jan-2026.)
Assertion
Ref Expression
pr1or2  |-  ( ( A  e.  C  /\  B  e.  D  /\ DECID  A  =  B )  ->  ( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )

Proof of Theorem pr1or2
StepHypRef Expression
1 dcne 2425 . . 3  |-  (DECID  A  =  B  <->  ( A  =  B  \/  A  =/= 
B ) )
2 enpr1g 7051 . . . . . . 7  |-  ( A  e.  C  ->  { A ,  A }  ~~  1o )
32ad2antrr 488 . . . . . 6  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =  B )  ->  { A ,  A }  ~~  1o )
4 preq2 3774 . . . . . . . 8  |-  ( A  =  B  ->  { A ,  A }  =  { A ,  B }
)
54breq1d 4124 . . . . . . 7  |-  ( A  =  B  ->  ( { A ,  A }  ~~  1o  <->  { A ,  B }  ~~  1o ) )
65adantl 277 . . . . . 6  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =  B )  ->  ( { A ,  A }  ~~  1o  <->  { A ,  B }  ~~  1o ) )
73, 6mpbid 147 . . . . 5  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =  B )  ->  { A ,  B }  ~~  1o )
87orcd 741 . . . 4  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =  B )  ->  ( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )
9 pr2ne 7502 . . . . . 6  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( { A ,  B }  ~~  2o  <->  A  =/=  B ) )
109biimpar 297 . . . . 5  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =/=  B )  ->  { A ,  B }  ~~  2o )
1110olcd 742 . . . 4  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =/=  B )  ->  ( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )
128, 11jaodan 805 . . 3  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  ( A  =  B  \/  A  =/=  B ) )  -> 
( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )
131, 12sylan2b 287 . 2  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\ DECID  A  =  B
)  ->  ( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )
14133impa 1221 1  |-  ( ( A  e.  C  /\  B  e.  D  /\ DECID  A  =  B )  ->  ( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716  DECID wdc 842    /\ w3a 1005    = wceq 1398    e. wcel 2205    =/= wne 2414   {cpr 3695   class class class wbr 4114   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  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  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-reu 2529  df-rab 2531  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-int 3955  df-br 4115  df-opab 4177  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  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:  upgr1elem1  16227
  Copyright terms: Public domain W3C validator