HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem nnmord 3189
Description: Ordering property of multiplication. Proposition 8.19 of [TakeutiZaring] p. 63, limited to natural numbers.
Assertion
Ref Expression
nnmord ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → ((AB ∧ ∅ ∈ C) ↔ (C ·o A) ∈ (C ·o B)))

Proof of Theorem nnmord
StepHypRef Expression
1 nnmordi 3188 . 2 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → ((AB ∧ ∅ ∈ C) → (C ·o A) ∈ (C ·o B)))
2 opreq1 3006 . . . . . . . . . 10 (C = ∅ → (C ·o B) = (∅ ·o B))
32cleq1d 1109 . . . . . . . . 9 (C = ∅ → ((C ·o B) = ∅ ↔ (∅ ·o B) = ∅))
4 nnm0r 3171 . . . . . . . . 9 (B ∈ ω → (∅ ·o B) = ∅)
53, 4syl5bir 184 . . . . . . . 8 (C = ∅ → (B ∈ ω → (C ·o B) = ∅))
65com12 13 . . . . . . 7 (B ∈ ω → (C = ∅ → (C ·o B) = ∅))
7 n0i 1712 . . . . . . 7 ((C ·o A) ∈ (C ·o B) → ¬ (C ·o B) = ∅)
86, 7nsyli 106 . . . . . 6 (B ∈ ω → ((C ·o A) ∈ (C ·o B) → ¬ C = ∅))
98adantr 306 . . . . 5 ((B ∈ ω ∧ C ∈ ω) → ((C ·o A) ∈ (C ·o B) → ¬ C = ∅))
10 nnord 2381 . . . . . . 7 (C ∈ ω → Ord C)
11 ord0eln0 2278 . . . . . . 7 (Ord C → (∅ ∈ C ↔ ¬ C = ∅))
1210, 11syl 12 . . . . . 6 (C ∈ ω → (∅ ∈ C ↔ ¬ C = ∅))
1312adantl 305 . . . . 5 ((B ∈ ω ∧ C ∈ ω) → (∅ ∈ C ↔ ¬ C = ∅))
149, 13sylibrd 179 . . . 4 ((B ∈ ω ∧ C ∈ ω) → ((C ·o A) ∈ (C ·o B) → ∅ ∈ C))
15143adant1 597 . . 3 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → ((C ·o A) ∈ (C ·o B) → ∅ ∈ C))
16 opreq2 3007 . . . . . . . . . 10 (A = B → (C ·o A) = (C ·o B))
1716a1i 7 . . . . . . . . 9 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → (A = B → (C ·o A) = (C ·o B)))
18 nnmordi 3188 . . . . . . . . . . . . 13 ((B ∈ ω ∧ A ∈ ω ∧ C ∈ ω) → ((BA ∧ ∅ ∈ C) → (C ·o B) ∈ (C ·o A)))
1918exp3a 292 . . . . . . . . . . . 12 ((B ∈ ω ∧ A ∈ ω ∧ C ∈ ω) → (BA → (∅ ∈ C → (C ·o B) ∈ (C ·o A))))
2019com23 32 . . . . . . . . . . 11 ((B ∈ ω ∧ A ∈ ω ∧ C ∈ ω) → (∅ ∈ C → (BA → (C ·o B) ∈ (C ·o A))))
21203com12 614 . . . . . . . . . 10 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → (∅ ∈ C → (BA → (C ·o B) ∈ (C ·o A))))
2221imp 277 . . . . . . . . 9 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → (BA → (C ·o B) ∈ (C ·o A)))
2317, 22orim12d 436 . . . . . . . 8 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → ((A = BBA) → ((C ·o A) = (C ·o B) ∨ (C ·o B) ∈ (C ·o A))))
2423con3d 87 . . . . . . 7 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → (¬ ((C ·o A) = (C ·o B) ∨ (C ·o B) ∈ (C ·o A)) → ¬ (A = BBA)))
25 pm3.26 256 . . . . . . . . 9 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → (A ∈ ω ∧ B ∈ ω ∧ C ∈ ω))
26 df-3an 583 . . . . . . . . . 10 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ↔ ((A ∈ ω ∧ B ∈ ω) ∧ C ∈ ω))
27 ancom 333 . . . . . . . . . 10 (((A ∈ ω ∧ B ∈ ω) ∧ C ∈ ω) ↔ (C ∈ ω ∧ (A ∈ ω ∧ B ∈ ω)))
28 anandi 392 . . . . . . . . . 10 ((C ∈ ω ∧ (A ∈ ω ∧ B ∈ ω)) ↔ ((C ∈ ω ∧ A ∈ ω) ∧ (C ∈ ω ∧ B ∈ ω)))
2926, 27, 283bitr 155 . . . . . . . . 9 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ↔ ((C ∈ ω ∧ A ∈ ω) ∧ (C ∈ ω ∧ B ∈ ω)))
3025, 29sylib 173 . . . . . . . 8 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → ((C ∈ ω ∧ A ∈ ω) ∧ (C ∈ ω ∧ B ∈ ω)))
31 nnmcl 3173 . . . . . . . . . 10 ((C ∈ ω ∧ A ∈ ω) → (C ·o A) ∈ ω)
32 nnord 2381 . . . . . . . . . 10 ((C ·o A) ∈ ω → Ord (C ·o A))
3331, 32syl 12 . . . . . . . . 9 ((C ∈ ω ∧ A ∈ ω) → Ord (C ·o A))
34 nnmcl 3173 . . . . . . . . . 10 ((C ∈ ω ∧ B ∈ ω) → (C ·o B) ∈ ω)
35 nnord 2381 . . . . . . . . . 10 ((C ·o B) ∈ ω → Ord (C ·o B))
3634, 35syl 12 . . . . . . . . 9 ((C ∈ ω ∧ B ∈ ω) → Ord (C ·o B))
3733, 36anim12i 268 . . . . . . . 8 (((C ∈ ω ∧ A ∈ ω) ∧ (C ∈ ω ∧ B ∈ ω)) → (Ord (C ·o A) ∧ Ord (C ·o B)))
38 ordtri2 2233 . . . . . . . 8 ((Ord (C ·o A) ∧ Ord (C ·o B)) → ((C ·o A) ∈ (C ·o B) ↔ ¬ ((C ·o A) = (C ·o B) ∨ (C ·o B) ∈ (C ·o A))))
3930, 37, 383syl 21 . . . . . . 7 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → ((C ·o A) ∈ (C ·o B) ↔ ¬ ((C ·o A) = (C ·o B) ∨ (C ·o B) ∈ (C ·o A))))
40 3simpa 591 . . . . . . . . 9 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → (A ∈ ω ∧ B ∈ ω))
41 nnord 2381 . . . . . . . . . 10 (A ∈ ω → Ord A)
42 nnord 2381 . . . . . . . . . 10 (B ∈ ω → Ord B)
4341, 42anim12i 268 . . . . . . . . 9 ((A ∈ ω ∧ B ∈ ω) → (Ord A ∧ Ord B))
4425, 40, 433syl 21 . . . . . . . 8 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → (Ord A ∧ Ord B))
45 ordtri2 2233 . . . . . . . 8 ((Ord A ∧ Ord B) → (AB ↔ ¬ (A = BBA)))
4644, 45syl 12 . . . . . . 7 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → (AB ↔ ¬ (A = BBA)))
4724, 39, 463imtr4d 421 . . . . . 6 (((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) ∧ ∅ ∈ C) → ((C ·o A) ∈ (C ·o B) → AB))
4847exp 291 . . . . 5 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → (∅ ∈ C → ((C ·o A) ∈ (C ·o B) → AB)))
4948com23 32 . . . 4 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → ((C ·o A) ∈ (C ·o B) → (∅ ∈ CAB)))
50 ancr 243 . . . 4 ((∅ ∈ CAB) → (∅ ∈ C → (AB ∧ ∅ ∈ C)))
5149, 50syl6 23 . . 3 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → ((C ·o A) ∈ (C ·o B) → (∅ ∈ C → (AB ∧ ∅ ∈ C))))
5215, 51mpdd 47 . 2 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → ((C ·o A) ∈ (C ·o B) → (AB ∧ ∅ ∈ C)))
531, 52impbid 397 1 ((A ∈ ω ∧ B ∈ ω ∧ C ∈ ω) → ((AB ∧ ∅ ∈ C) ↔ (C ·o A) ∈ (C ·o B)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ↔ wb 127   ∨ wo 195   ∧ wa 196   ∧ w3a 581   = wceq 1091   ∈ wcel 1092  ∅c0 1707  Ord word 2198  ωcom 2372  (class class class)co 3001   ·o comu 3102
This theorem is referenced by:  ltmpi 3825
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-fv 2438  df-rdg 2970  df-opr 3003  df-oprab 3004  df-oadd 3106  df-omul 3107
metamath.org