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

Theorem nnmord 6274
Description: Ordering property of multiplication. Proposition 8.19 of [TakeutiZaring] p. 63, limited to natural numbers. (Contributed by NM, 22-Jan-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
Assertion
Ref Expression
nnmord ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵)))

Proof of Theorem nnmord
StepHypRef Expression
1 nnmordi 6273 . . . . . 6 (((𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 → (𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵)))
21ex 113 . . . . 5 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → (𝐴𝐵 → (𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵))))
32com23 77 . . . 4 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 → (∅ ∈ 𝐶 → (𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵))))
43impd 251 . . 3 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵)))
543adant1 961 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵)))
6 ne0i 3292 . . . . . . . 8 ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → (𝐶 ·𝑜 𝐵) ≠ ∅)
7 nnm0r 6240 . . . . . . . . . 10 (𝐵 ∈ ω → (∅ ·𝑜 𝐵) = ∅)
8 oveq1 5659 . . . . . . . . . . 11 (𝐶 = ∅ → (𝐶 ·𝑜 𝐵) = (∅ ·𝑜 𝐵))
98eqeq1d 2096 . . . . . . . . . 10 (𝐶 = ∅ → ((𝐶 ·𝑜 𝐵) = ∅ ↔ (∅ ·𝑜 𝐵) = ∅))
107, 9syl5ibrcom 155 . . . . . . . . 9 (𝐵 ∈ ω → (𝐶 = ∅ → (𝐶 ·𝑜 𝐵) = ∅))
1110necon3d 2299 . . . . . . . 8 (𝐵 ∈ ω → ((𝐶 ·𝑜 𝐵) ≠ ∅ → 𝐶 ≠ ∅))
126, 11syl5 32 . . . . . . 7 (𝐵 ∈ ω → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → 𝐶 ≠ ∅))
1312adantr 270 . . . . . 6 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → 𝐶 ≠ ∅))
14 nn0eln0 4433 . . . . . . 7 (𝐶 ∈ ω → (∅ ∈ 𝐶𝐶 ≠ ∅))
1514adantl 271 . . . . . 6 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶𝐶 ≠ ∅))
1613, 15sylibrd 167 . . . . 5 ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → ∅ ∈ 𝐶))
17163adant1 961 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → ∅ ∈ 𝐶))
18 oveq2 5660 . . . . . . . . . 10 (𝐴 = 𝐵 → (𝐶 ·𝑜 𝐴) = (𝐶 ·𝑜 𝐵))
1918a1i 9 . . . . . . . . 9 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 = 𝐵 → (𝐶 ·𝑜 𝐴) = (𝐶 ·𝑜 𝐵)))
20 nnmordi 6273 . . . . . . . . . 10 (((𝐴 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵𝐴 → (𝐶 ·𝑜 𝐵) ∈ (𝐶 ·𝑜 𝐴)))
21203adantl2 1100 . . . . . . . . 9 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵𝐴 → (𝐶 ·𝑜 𝐵) ∈ (𝐶 ·𝑜 𝐴)))
2219, 21orim12d 735 . . . . . . . 8 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐴 = 𝐵𝐵𝐴) → ((𝐶 ·𝑜 𝐴) = (𝐶 ·𝑜 𝐵) ∨ (𝐶 ·𝑜 𝐵) ∈ (𝐶 ·𝑜 𝐴))))
2322con3d 596 . . . . . . 7 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (¬ ((𝐶 ·𝑜 𝐴) = (𝐶 ·𝑜 𝐵) ∨ (𝐶 ·𝑜 𝐵) ∈ (𝐶 ·𝑜 𝐴)) → ¬ (𝐴 = 𝐵𝐵𝐴)))
24 simpl3 948 . . . . . . . . 9 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐶 ∈ ω)
25 simpl1 946 . . . . . . . . 9 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐴 ∈ ω)
26 nnmcl 6242 . . . . . . . . 9 ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 ·𝑜 𝐴) ∈ ω)
2724, 25, 26syl2anc 403 . . . . . . . 8 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·𝑜 𝐴) ∈ ω)
28 simpl2 947 . . . . . . . . 9 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐵 ∈ ω)
29 nnmcl 6242 . . . . . . . . 9 ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ·𝑜 𝐵) ∈ ω)
3024, 28, 29syl2anc 403 . . . . . . . 8 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·𝑜 𝐵) ∈ ω)
31 nntri2 6255 . . . . . . . 8 (((𝐶 ·𝑜 𝐴) ∈ ω ∧ (𝐶 ·𝑜 𝐵) ∈ ω) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) ↔ ¬ ((𝐶 ·𝑜 𝐴) = (𝐶 ·𝑜 𝐵) ∨ (𝐶 ·𝑜 𝐵) ∈ (𝐶 ·𝑜 𝐴))))
3227, 30, 31syl2anc 403 . . . . . . 7 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) ↔ ¬ ((𝐶 ·𝑜 𝐴) = (𝐶 ·𝑜 𝐵) ∨ (𝐶 ·𝑜 𝐵) ∈ (𝐶 ·𝑜 𝐴))))
33 nntri2 6255 . . . . . . . 8 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ¬ (𝐴 = 𝐵𝐵𝐴)))
3425, 28, 33syl2anc 403 . . . . . . 7 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 ↔ ¬ (𝐴 = 𝐵𝐵𝐴)))
3523, 32, 343imtr4d 201 . . . . . 6 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → 𝐴𝐵))
3635ex 113 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → 𝐴𝐵)))
3736com23 77 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → (∅ ∈ 𝐶𝐴𝐵)))
3817, 37mpdd 40 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → 𝐴𝐵))
3938, 17jcad 301 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵) → (𝐴𝐵 ∧ ∅ ∈ 𝐶)))
405, 39impbid 127 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·𝑜 𝐴) ∈ (𝐶 ·𝑜 𝐵)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wb 103  wo 664  w3a 924   = wceq 1289  wcel 1438  wne 2255  c0 3286  ωcom 4405  (class class class)co 5652   ·𝑜 comu 6179
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3954  ax-sep 3957  ax-nul 3965  ax-pow 4009  ax-pr 4036  ax-un 4260  ax-setind 4353  ax-iinf 4403
This theorem depends on definitions:  df-bi 115  df-3or 925  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2841  df-csb 2934  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-nul 3287  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-int 3689  df-iun 3732  df-br 3846  df-opab 3900  df-mpt 3901  df-tr 3937  df-id 4120  df-iord 4193  df-on 4195  df-suc 4198  df-iom 4406  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-res 4450  df-ima 4451  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-f1 5020  df-fo 5021  df-f1o 5022  df-fv 5023  df-ov 5655  df-oprab 5656  df-mpt2 5657  df-1st 5911  df-2nd 5912  df-recs 6070  df-irdg 6135  df-oadd 6185  df-omul 6186
This theorem is referenced by:  nnmword  6275  ltmpig  6896
  Copyright terms: Public domain W3C validator