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

Theorem pr1or2 7534
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 2431 . . 3  |-  (DECID  A  =  B  <->  ( A  =  B  \/  A  =/= 
B ) )
2 enpr1g 7079 . . . . . . 7  |-  ( A  e.  C  ->  { A ,  A }  ~~  1o )
32ad2antrr 492 . . . . . 6  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =  B )  ->  { A ,  A }  ~~  1o )
4 preq2 3788 . . . . . . . 8  |-  ( A  =  B  ->  { A ,  A }  =  { A ,  B }
)
54breq1d 4138 . . . . . . 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 745 . . . 4  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =  B )  ->  ( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )
9 pr2ne 7532 . . . . . 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 746 . . . 4  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  A  =/=  B )  ->  ( { A ,  B }  ~~  1o  \/  { A ,  B }  ~~  2o ) )
128, 11jaodan 809 . . 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 1225 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 720  DECID wdc 846    /\ w3a 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   {cpr 3709   class class class wbr 4128   1oc1o 6674   2oc2o 6675    ~~ cen 7014
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 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 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  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-reu 2535  df-rab 2537  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 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-br 4129  df-opab 4191  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-1o 6681  df-2o 6682  df-er 6801  df-en 7017
This theorem is referenced by:  upgr1elem1  16344
  Copyright terms: Public domain W3C validator