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

Theorem nndceq 6662
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 4714. (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 6656 . . 3  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  e.  B  \/  A  =  B  \/  B  e.  A
) )
2 elirr 4637 . . . . . . 7  |-  -.  A  e.  A
3 eleq2 2293 . . . . . . 7  |-  ( A  =  B  ->  ( A  e.  A  <->  A  e.  B ) )
42, 3mtbii 678 . . . . . 6  |-  ( A  =  B  ->  -.  A  e.  B )
54con2i 630 . . . . 5  |-  ( A  e.  B  ->  -.  A  =  B )
65olcd 739 . . . 4  |-  ( A  e.  B  ->  ( A  =  B  \/  -.  A  =  B
) )
7 orc 717 . . . 4  |-  ( A  =  B  ->  ( A  =  B  \/  -.  A  =  B
) )
8 elirr 4637 . . . . . . 7  |-  -.  B  e.  B
9 eleq2 2293 . . . . . . 7  |-  ( A  =  B  ->  ( B  e.  A  <->  B  e.  B ) )
108, 9mtbiri 679 . . . . . 6  |-  ( A  =  B  ->  -.  B  e.  A )
1110con2i 630 . . . . 5  |-  ( B  e.  A  ->  -.  A  =  B )
1211olcd 739 . . . 4  |-  ( B  e.  A  ->  ( A  =  B  \/  -.  A  =  B
) )
136, 7, 123jaoi 1337 . . 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 840 . 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
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 713  DECID wdc 839    \/ w3o 1001    = wceq 1395    e. wcel 2200   omcom 4686
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-uni 3892  df-int 3927  df-tr 4186  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687
This theorem is referenced by:  nndifsnid  6670  fidceq  7051  fidcen  7081  unsnfidcex  7105  unsnfidcel  7106  nninfwlporlemd  7362  nninfwlporlem  7363  nninfwlpoimlemg  7365  nninfwlpoimlemginf  7366  2onetap  7464  2omotaplemap  7466  enqdc  7571  nninfctlemfo  12601  xpscf  13420  2omap  16530  nninfsellemdc  16548
  Copyright terms: Public domain W3C validator