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

Theorem nntri3or 6704
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 2295 . . . . 5 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
2 eqeq2 2241 . . . . 5 (𝑥 = 𝐵 → (𝐴 = 𝑥𝐴 = 𝐵))
3 eleq1 2294 . . . . 5 (𝑥 = 𝐵 → (𝑥𝐴𝐵𝐴))
41, 2, 33orbi123d 1348 . . . 4 (𝑥 = 𝐵 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴𝐵𝐴 = 𝐵𝐵𝐴)))
54imbi2d 230 . . 3 (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴𝑥𝐴 = 𝑥𝑥𝐴)) ↔ (𝐴 ∈ ω → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))))
6 eleq2 2295 . . . . 5 (𝑥 = ∅ → (𝐴𝑥𝐴 ∈ ∅))
7 eqeq2 2241 . . . . 5 (𝑥 = ∅ → (𝐴 = 𝑥𝐴 = ∅))
8 eleq1 2294 . . . . 5 (𝑥 = ∅ → (𝑥𝐴 ↔ ∅ ∈ 𝐴))
96, 7, 83orbi123d 1348 . . . 4 (𝑥 = ∅ → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
10 eleq2 2295 . . . . 5 (𝑥 = 𝑦 → (𝐴𝑥𝐴𝑦))
11 eqeq2 2241 . . . . 5 (𝑥 = 𝑦 → (𝐴 = 𝑥𝐴 = 𝑦))
12 eleq1 2294 . . . . 5 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
1310, 11, 123orbi123d 1348 . . . 4 (𝑥 = 𝑦 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴𝑦𝐴 = 𝑦𝑦𝐴)))
14 eleq2 2295 . . . . 5 (𝑥 = suc 𝑦 → (𝐴𝑥𝐴 ∈ suc 𝑦))
15 eqeq2 2241 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 = 𝑥𝐴 = suc 𝑦))
16 eleq1 2294 . . . . 5 (𝑥 = suc 𝑦 → (𝑥𝐴 ↔ suc 𝑦𝐴))
1714, 15, 163orbi123d 1348 . . . 4 (𝑥 = suc 𝑦 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
18 0elnn 4723 . . . . 5 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴))
19 olc 719 . . . . . 6 ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) → (𝐴 ∈ ∅ ∨ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
20 3orass 1008 . . . . . 6 ((𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴) ↔ (𝐴 ∈ ∅ ∨ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
2119, 20sylibr 134 . . . . 5 ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) → (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴))
2218, 21syl 14 . . . 4 (𝐴 ∈ ω → (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴))
23 df-3or 1006 . . . . . 6 ((𝐴𝑦𝐴 = 𝑦𝑦𝐴) ↔ ((𝐴𝑦𝐴 = 𝑦) ∨ 𝑦𝐴))
24 elex 2815 . . . . . . . 8 (𝑦 ∈ ω → 𝑦 ∈ V)
25 elsuc2g 4508 . . . . . . . . 9 (𝑦 ∈ V → (𝐴 ∈ suc 𝑦 ↔ (𝐴𝑦𝐴 = 𝑦)))
26 3mix1 1193 . . . . . . . . 9 (𝐴 ∈ suc 𝑦 → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴))
2725, 26biimtrrdi 164 . . . . . . . 8 (𝑦 ∈ V → ((𝐴𝑦𝐴 = 𝑦) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
2824, 27syl 14 . . . . . . 7 (𝑦 ∈ ω → ((𝐴𝑦𝐴 = 𝑦) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
29 nnsucelsuc 6702 . . . . . . . . 9 (𝐴 ∈ ω → (𝑦𝐴 ↔ suc 𝑦 ∈ suc 𝐴))
30 elsuci 4506 . . . . . . . . 9 (suc 𝑦 ∈ suc 𝐴 → (suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴))
3129, 30biimtrdi 163 . . . . . . . 8 (𝐴 ∈ ω → (𝑦𝐴 → (suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴)))
32 eqcom 2233 . . . . . . . . . . . . 13 (suc 𝑦 = 𝐴𝐴 = suc 𝑦)
3332orbi2i 770 . . . . . . . . . . . 12 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) ↔ (suc 𝑦𝐴𝐴 = suc 𝑦))
3433biimpi 120 . . . . . . . . . . 11 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) → (suc 𝑦𝐴𝐴 = suc 𝑦))
3534orcomd 737 . . . . . . . . . 10 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) → (𝐴 = suc 𝑦 ∨ suc 𝑦𝐴))
3635olcd 742 . . . . . . . . 9 ((suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴) → (𝐴 ∈ suc 𝑦 ∨ (𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
37 3orass 1008 . . . . . . . . 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 727 . . . . . 6 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → (((𝐴𝑦𝐴 = 𝑦) ∨ 𝑦𝐴) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
4123, 40biimtrid 152 . . . . 5 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴𝑦𝐴 = 𝑦𝑦𝐴) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
4241ex 115 . . . 4 (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴𝑦𝐴 = 𝑦𝑦𝐴) → (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴))))
439, 13, 17, 22, 42finds2 4705 . . 3 (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴𝑥𝐴 = 𝑥𝑥𝐴)))
445, 43vtoclga 2871 . 2 (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴𝐵𝐴 = 𝐵𝐵𝐴)))
4544impcom 125 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 716  w3o 1004   = wceq 1398  wcel 2202  Vcvv 2803  c0 3496  suc csuc 4468  ωcom 4694
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-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  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-uni 3899  df-int 3934  df-tr 4193  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695
This theorem is referenced by:  nntri2  6705  nntri1  6707  nntri3  6708  nntri2or2  6709  nndceq  6710  nndcel  6711  nnsseleq  6712  nntr2  6714  nnawordex  6740  nnwetri  7151  nnnninfeq  7370  ltsopi  7583  pitri3or  7585  frec2uzlt2d  10712  nninfctlemfo  12674  ennnfonelemk  13084  ennnfonelemex  13098
  Copyright terms: Public domain W3C validator