MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nnaord Structured version   Visualization version   GIF version

Theorem nnaord 8247
Description: Ordering property of addition. Proposition 8.4 of [TakeutiZaring] p. 58, limited to natural numbers, and its converse. (Contributed by NM, 7-Mar-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
Assertion
Ref Expression
nnaord ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))

Proof of Theorem nnaord
StepHypRef Expression
1 nnaordi 8246 . . 3 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
213adant1 1126 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
3 oveq2 7166 . . . . . 6 (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵))
43a1i 11 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵)))
5 nnaordi 8246 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐶 ∈ ω) → (𝐵𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
653adant2 1127 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐵𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
74, 6orim12d 961 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 = 𝐵𝐵𝐴) → ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
87con3d 155 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)) → ¬ (𝐴 = 𝐵𝐵𝐴)))
9 df-3an 1085 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐶 ∈ ω))
10 ancom 463 . . . . . 6 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐶 ∈ ω) ↔ (𝐶 ∈ ω ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)))
11 anandi 674 . . . . . 6 ((𝐶 ∈ ω ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) ↔ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ (𝐶 ∈ ω ∧ 𝐵 ∈ ω)))
129, 10, 113bitri 299 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ (𝐶 ∈ ω ∧ 𝐵 ∈ ω)))
13 nnacl 8239 . . . . . . 7 ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 +o 𝐴) ∈ ω)
14 nnord 7590 . . . . . . 7 ((𝐶 +o 𝐴) ∈ ω → Ord (𝐶 +o 𝐴))
1513, 14syl 17 . . . . . 6 ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → Ord (𝐶 +o 𝐴))
16 nnacl 8239 . . . . . . 7 ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 +o 𝐵) ∈ ω)
17 nnord 7590 . . . . . . 7 ((𝐶 +o 𝐵) ∈ ω → Ord (𝐶 +o 𝐵))
1816, 17syl 17 . . . . . 6 ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → Ord (𝐶 +o 𝐵))
1915, 18anim12i 614 . . . . 5 (((𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ (𝐶 ∈ ω ∧ 𝐵 ∈ ω)) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
2012, 19sylbi 219 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
21 ordtri2 6228 . . . 4 ((Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) ↔ ¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
2220, 21syl 17 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) ↔ ¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
23 nnord 7590 . . . . . 6 (𝐴 ∈ ω → Ord 𝐴)
24 nnord 7590 . . . . . 6 (𝐵 ∈ ω → Ord 𝐵)
2523, 24anim12i 614 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (Ord 𝐴 ∧ Ord 𝐵))
26253adant3 1128 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (Ord 𝐴 ∧ Ord 𝐵))
27 ordtri2 6228 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴𝐵 ↔ ¬ (𝐴 = 𝐵𝐵𝐴)))
2826, 27syl 17 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ ¬ (𝐴 = 𝐵𝐵𝐴)))
298, 22, 283imtr4d 296 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) → 𝐴𝐵))
302, 29impbid 214 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  w3a 1083   = wceq 1537  wcel 2114  Ord word 6192  (class class class)co 7158  ωcom 7582   +o coa 8101
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-oadd 8108
This theorem is referenced by:  nnaordr  8248  nnaword  8255  nnaordex  8266  nnneo  8280  unfilem1  8784  ltapi  10327  1lt2pi  10329
  Copyright terms: Public domain W3C validator