Theorem nnmwordi 8658

Description: Weak ordering property of multiplication. (Contributed by Mario Carneiro, 17-Nov-2014.)

Assertion

Ref	Expression
nnmwordi	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))

Proof of Theorem nnmwordi

Step	Hyp	Ref	Expression
1		nnmword 8656	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ⊆ 𝐵 ↔ (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
2	1	biimpd 232	. . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
3	2	ex 418	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (∅ ∈ 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))))
4		nnord 7895	. . . . . 6 ⊢ (𝐶 ∈ ω → Ord 𝐶)
5		ord0eln0 6426	. . . . . . 7 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅))
6	5	necon2bbid 3002	. . . . . 6 ⊢ (Ord 𝐶 → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
7	4, 6	syl 18	. . . . 5 ⊢ (𝐶 ∈ ω → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
8	7	3ad2ant3 1153	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶))
9		ssid 3935	. . . . . . 7 ⊢ ∅ ⊆ ∅
10		nnm0r 8633	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → (∅ ·o 𝐴) = ∅)
11	10	adantr 486	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∅ ·o 𝐴) = ∅)
12		nnm0r 8633	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
13	12	adantl 487	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∅ ·o 𝐵) = ∅)
14	11, 13	sseq12d 3946	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((∅ ·o 𝐴) ⊆ (∅ ·o 𝐵) ↔ ∅ ⊆ ∅))
15	9, 14	mpbiri 261	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵))
16		oveq1 7437	. . . . . . 7 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐴) = (∅ ·o 𝐴))
17		oveq1 7437	. . . . . . 7 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵))
18	16, 17	sseq12d 3946	. . . . . 6 ⊢ (𝐶 = ∅ → ((𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵) ↔ (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵)))
19	15, 18	syl5ibrcom 250	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
20	19	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
21	8, 20	sylbird 263	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (¬ ∅ ∈ 𝐶 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
22	21	a1dd 51	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (¬ ∅ ∈ 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))))
23	3, 22	pm2.61d 181	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   ⊆ wss 3900  ∅c0 4281  Ord word 6368  (class class class)co 7430  ωcom 7887   ·_o comu 8488

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761

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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-oadd 8494  df-omul 8495

This theorem is used by:  nnmwordri  8659  omopthlem1  8682