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

Theorem nndceq 6772
Description: Equality of natural numbers is decidable. Theorem 7.2.6 of [HoTT], p. (varies). For the specific case where  B is zero, see nndceq0 4765. (Contributed by Jim Kingdon, 31-Aug-2019.)
Assertion
Ref Expression
nndceq  |-  ( ( A  e.  om  /\  B  e.  om )  -> DECID  A  =  B )

Proof of Theorem nndceq
StepHypRef Expression
1 nntri3or 6766 . . 3  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  e.  B  \/  A  =  B  \/  B  e.  A
) )
2 elirr 4688 . . . . . . 7  |-  -.  A  e.  A
3 eleq2 2302 . . . . . . 7  |-  ( A  =  B  ->  ( A  e.  A  <->  A  e.  B ) )
42, 3mtbii 685 . . . . . 6  |-  ( A  =  B  ->  -.  A  e.  B )
54con2i 636 . . . . 5  |-  ( A  e.  B  ->  -.  A  =  B )
65olcd 746 . . . 4  |-  ( A  e.  B  ->  ( A  =  B  \/  -.  A  =  B
) )
7 orc 724 . . . 4  |-  ( A  =  B  ->  ( A  =  B  \/  -.  A  =  B
) )
8 elirr 4688 . . . . . . 7  |-  -.  B  e.  B
9 eleq2 2302 . . . . . . 7  |-  ( A  =  B  ->  ( B  e.  A  <->  B  e.  B ) )
108, 9mtbiri 686 . . . . . 6  |-  ( A  =  B  ->  -.  B  e.  A )
1110con2i 636 . . . . 5  |-  ( B  e.  A  ->  -.  A  =  B )
1211olcd 746 . . . 4  |-  ( B  e.  A  ->  ( A  =  B  \/  -.  A  =  B
) )
136, 7, 123jaoi 1344 . . 3  |-  ( ( A  e.  B  \/  A  =  B  \/  B  e.  A )  ->  ( A  =  B  \/  -.  A  =  B ) )
141, 13syl 14 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  =  B  \/  -.  A  =  B ) )
15 df-dc 847 . 2  |-  (DECID  A  =  B  <->  ( A  =  B  \/  -.  A  =  B ) )
1614, 15sylibr 134 1  |-  ( ( A  e.  om  /\  B  e.  om )  -> DECID  A  =  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 720  DECID wdc 846    \/ w3o 1008    = wceq 1402    e. wcel 2209   omcom 4737
This proof depends on 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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-uni 3936  df-int 3971  df-tr 4230  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738
This theorem is used by:  nndifsnid  6780  fidceq  7171  fidcen  7203  unsnfidcex  7227  unsnfidcel  7228  2omap  7318  nninfwlporlemd  7512  nninfwlporlem  7513  nninfwlpoimlemg  7515  nninfwlpoimlemginf  7516  2onetap  7621  2omotaplemap  7623  enqdc  7728  nninfctlemfo  12817  xpscf  13668  nninfsellemdc  17053
  Copyright terms: Public domain W3C validator