Theorem nnmord 8628

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 8627	. . . . 5 ⊢ (((𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
2	1	ex 414	. . . 4 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → (𝐴 ∈ 𝐵 → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))))
3	2	impcomd 413	. . 3 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
4	3	3adant1 1131	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
5		ne0i 4333	. . . . . . . 8 ⊢ ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐶 ·o 𝐵) ≠ ∅)
6		nnm0r 8606	. . . . . . . . . 10 ⊢ (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
7		oveq1 7411	. . . . . . . . . . 11 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
8	7	eqeq1d 2735	. . . . . . . . . 10 ⊢ (𝐶 = ∅ → ((𝐶 ·o 𝐵) = ∅ ↔ (∅ ·o 𝐵) = ∅))
9	6, 8	syl5ibrcom 246	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → (𝐶 = ∅ → (𝐶 ·o 𝐵) = ∅))
10	9	necon3d 2962	. . . . . . . 8 ⊢ (𝐵 ∈ ω → ((𝐶 ·o 𝐵) ≠ ∅ → 𝐶 ≠ ∅))
11	5, 10	syl5 34	. . . . . . 7 ⊢ (𝐵 ∈ ω → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
12	11	adantr 482	. . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
13		nnord 7858	. . . . . . . 8 ⊢ (𝐶 ∈ ω → Ord 𝐶)
14		ord0eln0 6416	. . . . . . . 8 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
15	13, 14	syl 17	. . . . . . 7 ⊢ (𝐶 ∈ ω → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
16	15	adantl 483	. . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
17	12, 16	sylibrd 259	. . . . 5 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
18	17	3adant1 1131	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
19		oveq2 7412	. . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝐶 ·o 𝐴) = (𝐶 ·o 𝐵))
20	19	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 = 𝐵 → (𝐶 ·o 𝐴) = (𝐶 ·o 𝐵)))
21		nnmordi 8627	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵 ∈ 𝐴 → (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)))
22	21	3adantl2 1168	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵 ∈ 𝐴 → (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)))
23	20, 22	orim12d 964	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) → ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
24	23	con3d 152	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)) → ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
25		simpl3 1194	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐶 ∈ ω)
26		simpl1 1192	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐴 ∈ ω)
27		nnmcl 8608	. . . . . . . . 9 ⊢ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 ·o 𝐴) ∈ ω)
28	25, 26, 27	syl2anc 585	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ ω)
29		simpl2 1193	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐵 ∈ ω)
30		nnmcl 8608	. . . . . . . . 9 ⊢ ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ·o 𝐵) ∈ ω)
31	25, 29, 30	syl2anc 585	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐵) ∈ ω)
32		nnord 7858	. . . . . . . . 9 ⊢ ((𝐶 ·o 𝐴) ∈ ω → Ord (𝐶 ·o 𝐴))
33		nnord 7858	. . . . . . . . 9 ⊢ ((𝐶 ·o 𝐵) ∈ ω → Ord (𝐶 ·o 𝐵))
34		ordtri2 6396	. . . . . . . . 9 ⊢ ((Ord (𝐶 ·o 𝐴) ∧ Ord (𝐶 ·o 𝐵)) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
35	32, 33, 34	syl2an 597	. . . . . . . 8 ⊢ (((𝐶 ·o 𝐴) ∈ ω ∧ (𝐶 ·o 𝐵) ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
36	28, 31, 35	syl2anc 585	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
37		nnord 7858	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → Ord 𝐴)
38		nnord 7858	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → Ord 𝐵)
39		ordtri2 6396	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
40	37, 38, 39	syl2an 597	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
41	26, 29, 40	syl2anc 585	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
42	24, 36, 41	3imtr4d 294	. . . . . 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 514	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶)))
47	4, 46	impbid 211	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 397   ∨ wo 846   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107   ≠ wne 2941  ∅c0 4321  Ord word 6360  (class class class)co 7404  ωcom 7850   ·_o comu 8459

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7720

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7407  df-oprab 7408  df-mpo 7409  df-om 7851  df-2nd 7971  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-rdg 8405  df-oadd 8465  df-omul 8466

This theorem is referenced by:  nnmword  8629  nnneo  8650  ltmpi  10895