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

Theorem pr1or2 7442
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 2414 . . 3  |-  (DECID  A  =  B  <->  ( A  =  B  \/  A  =/= 
B ) )
2 enpr1g 7015 . . . . . . 7  |-  ( A  e.  C  ->  { A ,  A }  ~~  1o )
32ad2antrr 488 . . . . . 6  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =  B )  ->  { A ,  A }  ~~  1o )
4 preq2 3753 . . . . . . . 8  |-  ( A  =  B  ->  { A ,  A }  =  { A ,  B }
)
54breq1d 4103 . . . . . . 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 7440 . . . . . 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 2202    =/= wne 2403   {cpr 3674   class class class wbr 4093   1oc1o 6618   2oc2o 6619    ~~ cen 6950
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1o 6625  df-2o 6626  df-er 6745  df-en 6953
This theorem is referenced by:  upgr1elem1  16041
  Copyright terms: Public domain W3C validator