Theorem nnmord 8641

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 8640	. . . . 5 ⊢ (((𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
2	1	ex 418	. . . 4 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → (𝐴 ∈ 𝐵 → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))))
3	2	impcomd 417	. . 3 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
4	3	3adant1 1148	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
5		ne0i 4286	. . . . . . . 8 ⊢ ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐶 ·o 𝐵) ≠ ∅)
6		nnm0r 8619	. . . . . . . . . 10 ⊢ (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
7		oveq1 7427	. . . . . . . . . . 11 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
8	7	eqeq1d 2762	. . . . . . . . . 10 ⊢ (𝐶 = ∅ → ((𝐶 ·o 𝐵) = ∅ ↔ (∅ ·o 𝐵) = ∅))
9	6, 8	syl5ibrcom 250	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → (𝐶 = ∅ → (𝐶 ·o 𝐵) = ∅))
10	9	necon3d 2976	. . . . . . . 8 ⊢ (𝐵 ∈ ω → ((𝐶 ·o 𝐵) ≠ ∅ → 𝐶 ≠ ∅))
11	5, 10	syl5 35	. . . . . . 7 ⊢ (𝐵 ∈ ω → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
12	11	adantr 486	. . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅))
13		nnord 7885	. . . . . . . 8 ⊢ (𝐶 ∈ ω → Ord 𝐶)
14		ord0eln0 6419	. . . . . . . 8 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
15	13, 14	syl 18	. . . . . . 7 ⊢ (𝐶 ∈ ω → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
16	15	adantl 487	. . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
17	12, 16	sylibrd 262	. . . . 5 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
18	17	3adant1 1148	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶))
19		oveq2 7428	. . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝐶 ·o 𝐴) = (𝐶 ·o 𝐵))
20	19	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 = 𝐵 → (𝐶 ·o 𝐴) = (𝐶 ·o 𝐵)))
21		nnmordi 8640	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵 ∈ 𝐴 → (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)))
22	21	3adantl2 1186	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐵 ∈ 𝐴 → (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)))
23	20, 22	orim12d 979	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) → ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
24	23	con3d 153	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴)) → ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
25		simpl3 1212	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐶 ∈ ω)
26		simpl1 1210	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐴 ∈ ω)
27		nnmcl 8621	. . . . . . . . 9 ⊢ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 ·o 𝐴) ∈ ω)
28	25, 26, 27	syl2anc 596	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ ω)
29		simpl2 1211	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → 𝐵 ∈ ω)
30		nnmcl 8621	. . . . . . . . 9 ⊢ ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ·o 𝐵) ∈ ω)
31	25, 29, 30	syl2anc 596	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐵) ∈ ω)
32		nnord 7885	. . . . . . . . 9 ⊢ ((𝐶 ·o 𝐴) ∈ ω → Ord (𝐶 ·o 𝐴))
33		nnord 7885	. . . . . . . . 9 ⊢ ((𝐶 ·o 𝐵) ∈ ω → Ord (𝐶 ·o 𝐵))
34		ordtri2 6398	. . . . . . . . 9 ⊢ ((Ord (𝐶 ·o 𝐴) ∧ Ord (𝐶 ·o 𝐵)) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
35	32, 33, 34	syl2an 608	. . . . . . . 8 ⊢ (((𝐶 ·o 𝐴) ∈ ω ∧ (𝐶 ·o 𝐵) ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
36	28, 31, 35	syl2anc 596	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ↔ ¬ ((𝐶 ·o 𝐴) = (𝐶 ·o 𝐵) ∨ (𝐶 ·o 𝐵) ∈ (𝐶 ·o 𝐴))))
37		nnord 7885	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → Ord 𝐴)
38		nnord 7885	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → Ord 𝐵)
39		ordtri2 6398	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
40	37, 38, 39	syl2an 608	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
41	26, 29, 40	syl2anc 596	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
42	24, 36, 41	3imtr4d 297	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐴 ∈ 𝐵))
43	42	ex 418	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐴 ∈ 𝐵)))
44	43	com23 87	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (∅ ∈ 𝐶 → 𝐴 ∈ 𝐵)))
45	18, 44	mpdd 44	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐴 ∈ 𝐵))
46	45, 18	jcad 522	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶)))
47	4, 46	impbid 215	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∅c0 4278  Ord word 6361  (class class class)co 7420  ωcom 7877   ·_o comu 8474

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-oadd 8480  df-omul 8481

This theorem is used by:  nnmword  8642  nnneo  8664  ltmpi  10989