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

Theorem nntri3or 6739
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 2298 . . . . 5 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
2 eqeq2 2244 . . . . 5 (𝑥 = 𝐵 → (𝐴 = 𝑥𝐴 = 𝐵))
3 eleq1 2297 . . . . 5 (𝑥 = 𝐵 → (𝑥𝐴𝐵𝐴))
41, 2, 33orbi123d 1348 . . . 4 (𝑥 = 𝐵 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴𝐵𝐴 = 𝐵𝐵𝐴)))
54imbi2d 230 . . 3 (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴𝑥𝐴 = 𝑥𝑥𝐴)) ↔ (𝐴 ∈ ω → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))))
6 eleq2 2298 . . . . 5 (𝑥 = ∅ → (𝐴𝑥𝐴 ∈ ∅))
7 eqeq2 2244 . . . . 5 (𝑥 = ∅ → (𝐴 = 𝑥𝐴 = ∅))
8 eleq1 2297 . . . . 5 (𝑥 = ∅ → (𝑥𝐴 ↔ ∅ ∈ 𝐴))
96, 7, 83orbi123d 1348 . . . 4 (𝑥 = ∅ → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
10 eleq2 2298 . . . . 5 (𝑥 = 𝑦 → (𝐴𝑥𝐴𝑦))
11 eqeq2 2244 . . . . 5 (𝑥 = 𝑦 → (𝐴 = 𝑥𝐴 = 𝑦))
12 eleq1 2297 . . . . 5 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
1310, 11, 123orbi123d 1348 . . . 4 (𝑥 = 𝑦 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴𝑦𝐴 = 𝑦𝑦𝐴)))
14 eleq2 2298 . . . . 5 (𝑥 = suc 𝑦 → (𝐴𝑥𝐴 ∈ suc 𝑦))
15 eqeq2 2244 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 = 𝑥𝐴 = suc 𝑦))
16 eleq1 2297 . . . . 5 (𝑥 = suc 𝑦 → (𝑥𝐴 ↔ suc 𝑦𝐴))
1714, 15, 163orbi123d 1348 . . . 4 (𝑥 = suc 𝑦 → ((𝐴𝑥𝐴 = 𝑥𝑥𝐴) ↔ (𝐴 ∈ suc 𝑦𝐴 = suc 𝑦 ∨ suc 𝑦𝐴)))
18 0elnn 4746 . . . . 5 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴))
19 olc 719 . . . . . 6 ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) → (𝐴 ∈ ∅ ∨ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
20 3orass 1008 . . . . . 6 ((𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴) ↔ (𝐴 ∈ ∅ ∨ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
2119, 20sylibr 134 . . . . 5 ((𝐴 = ∅ ∨ ∅ ∈ 𝐴) → (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴))
2218, 21syl 14 . . . 4 (𝐴 ∈ ω → (𝐴 ∈ ∅ ∨ 𝐴 = ∅ ∨ ∅ ∈ 𝐴))
23 df-3or 1006 . . . . . 6 ((𝐴𝑦𝐴 = 𝑦𝑦𝐴) ↔ ((𝐴𝑦𝐴 = 𝑦) ∨ 𝑦𝐴))
24 elex 2827 . . . . . . . 8 (𝑦 ∈ ω → 𝑦 ∈ V)
25 elsuc2g 4531 . . . . . . . . 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 6737 . . . . . . . . 9 (𝐴 ∈ ω → (𝑦𝐴 ↔ suc 𝑦 ∈ suc 𝐴))
30 elsuci 4529 . . . . . . . . 9 (suc 𝑦 ∈ suc 𝐴 → (suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴))
3129, 30biimtrdi 163 . . . . . . . 8 (𝐴 ∈ ω → (𝑦𝐴 → (suc 𝑦𝐴 ∨ suc 𝑦 = 𝐴)))
32 eqcom 2236 . . . . . . . . . . . . 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 4728 . . 3 (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴𝑥𝐴 = 𝑥𝑥𝐴)))
445, 43vtoclga 2883 . 2 (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴𝐵𝐴 = 𝐵𝐵𝐴)))
4544impcom 125 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 716  w3o 1004   = wceq 1398  wcel 2205  Vcvv 2815  c0 3512  suc csuc 4491  ωcom 4717
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-tr 4214  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718
This theorem is referenced by:  nntri2  6740  nntri1  6742  nntri3  6743  nntri2or2  6744  nndceq  6745  nndcel  6746  nnsseleq  6747  nntr2  6749  nnawordex  6775  nnwetri  7189  nnnninfeq  7432  ltsopi  7651  pitri3or  7653  frec2uzlt2d  10790  nninfctlemfo  12761  ennnfonelemk  13235  ennnfonelemex  13249
  Copyright terms: Public domain W3C validator