Theorem nnmord 8562

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	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))

Proof of Theorem nnmord

Step	Hyp	Ref	Expression
1		nnmordi 8561	. . . . 5 ⊢ (((𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
2	1	ex 414	. . . 4 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → (𝐴 ∈ 𝐵 → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))))
3	2	impcomd 413	. . 3 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
4	3	3adant1 1137	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
5		ne0i 4272	. . . . . . . 8 ⊢ ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐶 ·o 𝐵) ≠ ∅)
6		nnm0r 8540	. . . . . . . . . 10 ⊢ (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
7		oveq1 7367	. . . . . . . . . . 11 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
8	7	eqeq1d 2743	. . . . . . . . . 10 ⊢ (𝐶 = ∅ → ((𝐶 ·o 𝐵) = ∅ ↔ (∅ ·o 𝐵) = ∅))
9	6, 8	syl5ibrcom 249	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → (𝐶 = ∅ → (𝐶 ·o 𝐵) = ∅))
10	9	necon3d 2957	. . . . . . . 8 ⊢ (𝐵 ∈ ω → ((𝐶 ·o 𝐵) ≠ ∅ → 𝐶 ≠ ∅))
11	5, 10	syl5 34	. . . . . . 7 ⊢ (𝐵 ∈ ω → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
12	11	adantr 482	. . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
13		nnord 7818	. . . . . . . 8 ⊢ (𝐶 ∈ ω → Ord 𝐶)
14		ord0eln0 6370	. . . . . . . 8 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
15	13, 14	syl 17	. . . . . . 7 ⊢ (𝐶 ∈ ω → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
16	15	adantl 483	. . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
17	12, 16	sylibrd 261	. . . . 5 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
18	17	3adant1 1137	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
19		oveq2 7368	. . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝐶 ·o 𝐴) = (𝐶 ·o 𝐵))
20	19	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 = 𝐵 → (𝐶 ·o 𝐴) = (𝐶 ·o 𝐵)))
21		nnmordi 8561	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵 ∈ 𝐴 → (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)))
22	21	3adantl2 1175	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵 ∈ 𝐴 → (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)))
23	20, 22	orim12d 973	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) → ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
24	23	con3d 152	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)) → ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
25		simpl3 1201	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐶 ∈ ω)
26		simpl1 1199	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐴 ∈ ω)
27		nnmcl 8542	. . . . . . . . 9 ⊢ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 ·o 𝐴) ∈ ω)
28	25, 26, 27	syl2anc 591	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ ω)
29		simpl2 1200	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐵 ∈ ω)
30		nnmcl 8542	. . . . . . . . 9 ⊢ ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ·o 𝐵) ∈ ω)
31	25, 29, 30	syl2anc 591	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐵) ∈ ω)
32		nnord 7818	. . . . . . . . 9 ⊢ ((𝐶 ·o 𝐴) ∈ ω → Ord (𝐶 ·o 𝐴))
33		nnord 7818	. . . . . . . . 9 ⊢ ((𝐶 ·o 𝐵) ∈ ω → Ord (𝐶 ·o 𝐵))
34		ordtri2 6349	. . . . . . . . 9 ⊢ ((Ord (𝐶 ·o 𝐴) ∧ Ord (𝐶 ·o 𝐵)) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
35	32, 33, 34	syl2an 603	. . . . . . . 8 ⊢ (((𝐶 ·o 𝐴) ∈ ω ∧ (𝐶 ·o 𝐵) ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
36	28, 31, 35	syl2anc 591	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
37		nnord 7818	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → Ord 𝐴)
38		nnord 7818	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → Ord 𝐵)
39		ordtri2 6349	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
40	37, 38, 39	syl2an 603	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
41	26, 29, 40	syl2anc 591	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
42	24, 36, 41	3imtr4d 296	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐴 ∈ 𝐵))
43	42	ex 414	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐴 ∈ 𝐵)))
44	43	com23 86	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (∅ ∈ 𝐶 → 𝐴 ∈ 𝐵)))
45	18, 44	mpdd 43	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐴 ∈ 𝐵))
46	45, 18	jcad 518	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶)))
47	4, 46	impbid 214	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 397   ∨ wo 854   ∧ w3a 1093   = wceq 1548   ∈ wcel 2121   ≠ wne 2936  ∅c0 4264  Ord word 6313  (class class class)co 7360  ωcom 7810   ·_o comu 8397

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-oadd 8403  df-omul 8404

This theorem is referenced by:  nnmword  8563  nnneo  8585  ltmpi  10822