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

Theorem nntri3or 6647
Description: Trichotomy for natural numbers. (Contributed by Jim Kingdon, 25-Aug-2019.)
Assertion
Ref Expression
nntri3or ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))

Proof of Theorem nntri3or
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq2 2293 . . . . 5 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
2 eqeq2 2239 . . . . 5 (𝑥 = 𝐵 → (𝐴 = 𝑥𝐴 = 𝐵))
3 eleq1 2292 . . . . 5 (𝑥 = 𝐵 → (𝑥𝐴𝐵𝐴))
41, 2, 33orbi123d 1345 . . . 4 (𝑥 = 𝐵 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴𝐵𝐴 = 𝐵𝐵𝐴)))
54imbi2d 230 . . 3 (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴𝑥𝐴 = 𝑥𝑥𝐴)) ↔ (𝐴 ∈ ω → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))))
6 eleq2 2293 . . . . 5 (𝑥 = ∅ → (𝐴𝑥𝐴 ∈ ∅))
7 eqeq2 2239 . . . . 5 (𝑥 = ∅ → (𝐴 = 𝑥𝐴 = ∅))
8 eleq1 2292 . . . . 5 (𝑥 = ∅ → (𝑥𝐴 ↔ ∅ ∈ 𝐴))
96, 7, 83orbi123d 1345 . . . 4 (𝑥 = ∅ → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
10 eleq2 2293 . . . . 5 (𝑥 = 𝑦 → (𝐴𝑥𝐴𝑦))
11 eqeq2 2239 . . . . 5 (𝑥 = 𝑦 → (𝐴 = 𝑥𝐴 = 𝑦))
12 eleq1 2292 . . . . 5 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
1310, 11, 123orbi123d 1345 . . . 4 (𝑥 = 𝑦 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴𝑦𝐴 = 𝑦𝑦𝐴)))
14 eleq2 2293 . . . . 5 (𝑥 = suc 𝑦 → (𝐴𝑥𝐴 ∈ suc 𝑦))
15 eqeq2 2239 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 = 𝑥𝐴 = suc 𝑦))
16 eleq1 2292 . . . . 5 (𝑥 = suc 𝑦 → (𝑥𝐴 ↔ suc 𝑦𝐴))
1714, 15, 163orbi123d 1345 . . . 4 (𝑥 = suc 𝑦 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
18 0elnn 4711 . . . . 5 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴))
19 olc 716 . . . . . 6 ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) → (𝐴 ∈ ∅ ∨ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
20 3orass 1005 . . . . . 6 ((𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴) ↔ (𝐴 ∈ ∅ ∨ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
2119, 20sylibr 134 . . . . 5 ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) → (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴))
2218, 21syl 14 . . . 4 (𝐴 ∈ ω → (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴))
23 df-3or 1003 . . . . . 6 ((𝐴𝑦𝐴 = 𝑦𝑦𝐴) ↔ ((𝐴𝑦𝐴 = 𝑦) ∨ 𝑦𝐴))
24 elex 2811 . . . . . . . 8 (𝑦 ∈ ω → 𝑦 ∈ V)
25 elsuc2g 4496 . . . . . . . . 9 (𝑦 ∈ V → (𝐴 ∈ suc 𝑦 ↔ (𝐴𝑦𝐴 = 𝑦)))
26 3mix1 1190 . . . . . . . . 9 (𝐴 ∈ suc 𝑦 → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴))
2725, 26biimtrrdi 164 . . . . . . . 8 (𝑦 ∈ V → ((𝐴𝑦𝐴 = 𝑦) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
2824, 27syl 14 . . . . . . 7 (𝑦 ∈ ω → ((𝐴𝑦𝐴 = 𝑦) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
29 nnsucelsuc 6645 . . . . . . . . 9 (𝐴 ∈ ω → (𝑦𝐴 ↔ suc 𝑦 ∈ suc 𝐴))
30 elsuci 4494 . . . . . . . . 9 (suc 𝑦 ∈ suc 𝐴 → (suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴))
3129, 30biimtrdi 163 . . . . . . . 8 (𝐴 ∈ ω → (𝑦𝐴 → (suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴)))
32 eqcom 2231 . . . . . . . . . . . . 13 (suc 𝑦 = 𝐴𝐴 = suc 𝑦)
3332orbi2i 767 . . . . . . . . . . . 12 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) ↔ (suc 𝑦𝐴𝐴 = suc 𝑦))
3433biimpi 120 . . . . . . . . . . 11 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) → (suc 𝑦𝐴𝐴 = suc 𝑦))
3534orcomd 734 . . . . . . . . . 10 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) → (𝐴 = suc 𝑦 ∨ suc 𝑦𝐴))
3635olcd 739 . . . . . . . . 9 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) → (𝐴 ∈ suc 𝑦 ∨ (𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
37 3orass 1005 . . . . . . . . 9 ((𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴) ↔ (𝐴 ∈ suc 𝑦 ∨ (𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
3836, 37sylibr 134 . . . . . . . 8 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴))
3931, 38syl6 33 . . . . . . 7 (𝐴 ∈ ω → (𝑦𝐴 → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
4028, 39jaao 724 . . . . . 6 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → (((𝐴𝑦𝐴 = 𝑦) ∨ 𝑦𝐴) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
4123, 40biimtrid 152 . . . . 5 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴𝑦𝐴 = 𝑦𝑦𝐴) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
4241ex 115 . . . 4 (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴𝑦𝐴 = 𝑦𝑦𝐴) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴))))
439, 13, 17, 22, 42finds2 4693 . . 3 (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴𝑥𝐴 = 𝑥𝑥𝐴)))
445, 43vtoclga 2867 . 2 (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴𝐵𝐴 = 𝐵𝐵𝐴)))
4544impcom 125 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 713  w3o 1001   = wceq 1395  wcel 2200  Vcvv 2799  c0 3491  suc csuc 4456  ωcom 4682
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 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  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-ral 2513  df-rex 2514  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-uni 3889  df-int 3924  df-tr 4183  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683
This theorem is referenced by:  nntri2  6648  nntri1  6650  nntri3  6651  nntri2or2  6652  nndceq  6653  nndcel  6654  nnsseleq  6655  nntr2  6657  nnawordex  6683  nnwetri  7089  nnnninfeq  7306  ltsopi  7518  pitri3or  7520  frec2uzlt2d  10638  nninfctlemfo  12576  ennnfonelemk  12986  ennnfonelemex  13000
  Copyright terms: Public domain W3C validator