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

Theorem nnaord 8269
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 8268 . . 3 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
213adant1 1131 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
3 oveq2 7172 . . . . . 6 (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵))
43a1i 11 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵)))
5 nnaordi 8268 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐶 ∈ ω) → (𝐵𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
653adant2 1132 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐵𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
74, 6orim12d 964 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 = 𝐵𝐵𝐴) → ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
87con3d 155 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)) → ¬ (𝐴 = 𝐵𝐵𝐴)))
9 df-3an 1090 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐶 ∈ ω))
10 ancom 464 . . . . . 6 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐶 ∈ ω) ↔ (𝐶 ∈ ω ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)))
11 anandi 676 . . . . . 6 ((𝐶 ∈ ω ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) ↔ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ (𝐶 ∈ ω ∧ 𝐵 ∈ ω)))
129, 10, 113bitri 300 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ (𝐶 ∈ ω ∧ 𝐵 ∈ ω)))
13 nnacl 8261 . . . . . . 7 ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 +o 𝐴) ∈ ω)
14 nnord 7601 . . . . . . 7 ((𝐶 +o 𝐴) ∈ ω → Ord (𝐶 +o 𝐴))
1513, 14syl 17 . . . . . 6 ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → Ord (𝐶 +o 𝐴))
16 nnacl 8261 . . . . . . 7 ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 +o 𝐵) ∈ ω)
17 nnord 7601 . . . . . . 7 ((𝐶 +o 𝐵) ∈ ω → Ord (𝐶 +o 𝐵))
1816, 17syl 17 . . . . . 6 ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → Ord (𝐶 +o 𝐵))
1915, 18anim12i 616 . . . . 5 (((𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ (𝐶 ∈ ω ∧ 𝐵 ∈ ω)) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
2012, 19sylbi 220 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
21 ordtri2 6201 . . . 4 ((Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) ↔ ¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
2220, 21syl 17 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) ↔ ¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
23 nnord 7601 . . . . . 6 (𝐴 ∈ ω → Ord 𝐴)
24 nnord 7601 . . . . . 6 (𝐵 ∈ ω → Ord 𝐵)
2523, 24anim12i 616 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (Ord 𝐴 ∧ Ord 𝐵))
26253adant3 1133 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (Ord 𝐴 ∧ Ord 𝐵))
27 ordtri2 6201 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴𝐵 ↔ ¬ (𝐴 = 𝐵𝐵𝐴)))
2826, 27syl 17 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ ¬ (𝐴 = 𝐵𝐵𝐴)))
298, 22, 283imtr4d 297 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) → 𝐴𝐵))
302, 29impbid 215 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  wo 846  w3a 1088   = wceq 1542  wcel 2113  Ord word 6165  (class class class)co 7164  ωcom 7593   +o coa 8121
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2161  ax-12 2178  ax-ext 2710  ax-sep 5164  ax-nul 5171  ax-pr 5293  ax-un 7473
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-ral 3058  df-rex 3059  df-reu 3060  df-rab 3062  df-v 3399  df-sbc 3680  df-csb 3789  df-dif 3844  df-un 3846  df-in 3848  df-ss 3858  df-pss 3860  df-nul 4210  df-if 4412  df-pw 4487  df-sn 4514  df-pr 4516  df-tp 4518  df-op 4520  df-uni 4794  df-iun 4880  df-br 5028  df-opab 5090  df-mpt 5108  df-tr 5134  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6123  df-ord 6169  df-on 6170  df-lim 6171  df-suc 6172  df-iota 6291  df-fun 6335  df-fn 6336  df-f 6337  df-f1 6338  df-fo 6339  df-f1o 6340  df-fv 6341  df-ov 7167  df-oprab 7168  df-mpo 7169  df-om 7594  df-wrecs 7969  df-recs 8030  df-rdg 8068  df-oadd 8128
This theorem is referenced by:  nnaordr  8270  nnaword  8277  nnaordex  8288  nnneo  8302  unfilem1  8849  ltapi  10396  1lt2pi  10398
  Copyright terms: Public domain W3C validator