Theorem omwordri 8481

Description: Weak ordering property of ordinal multiplication. Proposition 8.21 of [TakeutiZaring] p. 63. (Contributed by NM, 20-Dec-2004.)

Assertion

Ref	Expression
omwordri	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))

Proof of Theorem omwordri

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7348	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐴 ·o 𝑥) = (𝐴 ·o ∅))
2		oveq2 7348	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐵 ·o 𝑥) = (𝐵 ·o ∅))
3	1, 2	sseq12d 3965	. . . . 5 ⊢ (𝑥 = ∅ → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅)))
4		oveq2 7348	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑦))
5		oveq2 7348	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝑦))
6	4, 5	sseq12d 3965	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦)))
7		oveq2 7348	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o suc 𝑦))
8		oveq2 7348	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o suc 𝑦))
9	7, 8	sseq12d 3965	. . . . 5 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦)))
10		oveq2 7348	. . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝐶))
11		oveq2 7348	. . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝐶))
12	10, 11	sseq12d 3965	. . . . 5 ⊢ (𝑥 = 𝐶 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
13		om0 8426	. . . . . . 7 ⊢ (𝐴 ∈ On → (𝐴 ·o ∅) = ∅)
14		0ss 4347	. . . . . . 7 ⊢ ∅ ⊆ (𝐵 ·o ∅)
15	13, 14	eqsstrdi 3976	. . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅))
16	15	ad2antrr 726	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅))
17		omcl 8445	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o 𝑦) ∈ On)
18	17	3adant2 1131	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o 𝑦) ∈ On)
19		omcl 8445	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o 𝑦) ∈ On)
20	19	3adant1 1130	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o 𝑦) ∈ On)
21		simp1 1136	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → 𝐴 ∈ On)
22		oawordri 8459	. . . . . . . . . . . . 13 ⊢ (((𝐴 ·o 𝑦) ∈ On ∧ (𝐵 ·o 𝑦) ∈ On ∧ 𝐴 ∈ On) → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴)))
23	18, 20, 21, 22	syl3anc 1373	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴)))
24	23	imp 406	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦)) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴))
25	24	adantrl 716	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴))
26		oaword 8458	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ (𝐵 ·o 𝑦) ∈ On) → (𝐴 ⊆ 𝐵 ↔ ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵)))
27	20, 26	syld3an3 1411	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ⊆ 𝐵 ↔ ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵)))
28	27	biimpa 476	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ 𝐴 ⊆ 𝐵) → ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵))
29	28	adantrr 717	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵))
30	25, 29	sstrd 3942	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵))
31		omsuc 8435	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴))
32	31	3adant2 1131	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴))
33	32	adantr 480	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴))
34		omsuc 8435	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
35	34	3adant1 1130	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
36	35	adantr 480	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
37	30, 33, 36	3sstr4d 3987	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))
38	37	exp520 1358	. . . . . . 7 ⊢ (𝐴 ∈ On → (𝐵 ∈ On → (𝑦 ∈ On → (𝐴 ⊆ 𝐵 → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))))))
39	38	com3r 87	. . . . . 6 ⊢ (𝑦 ∈ On → (𝐴 ∈ On → (𝐵 ∈ On → (𝐴 ⊆ 𝐵 → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))))))
40	39	imp4c 423	. . . . 5 ⊢ (𝑦 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))))
41		vex 3437	. . . . . . . 8 ⊢ 𝑥 ∈ V
42		ss2iun 4957	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
43		omlim 8442	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦))
44	43	ad2ant2rl 749	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (𝐴 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦))
45		omlim 8442	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
46	45	adantl 481	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (𝐵 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
47	44, 46	sseq12d 3965	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦)))
48	42, 47	imbitrrid 246	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥)))
49	48	anandirs 679	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥)))
50	41, 49	mpanr1 703	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ Lim 𝑥) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥)))
51	50	expcom 413	. . . . . 6 ⊢ (Lim 𝑥 → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥))))
52	51	adantrd 491	. . . . 5 ⊢ (Lim 𝑥 → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥))))
53	3, 6, 9, 12, 16, 40, 52	tfinds3 7789	. . . 4 ⊢ (𝐶 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
54	53	expd 415	. . 3 ⊢ (𝐶 ∈ On → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶))))
55	54	3impib 1116	. 2 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
56	55	3coml 1127	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  Vcvv 3433   ⊆ wss 3899  ∅c0 4280  ∪ ciun 4938  Oncon0 6301  Lim wlim 6302  suc csuc 6303  (class class class)co 7340   +_o coa 8376   ·_o comu 8377

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5214  ax-sep 5231  ax-nul 5241  ax-pr 5367  ax-un 7662

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3393  df-v 3435  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4940  df-br 5089  df-opab 5151  df-mpt 5170  df-tr 5196  df-id 5508  df-eprel 5513  df-po 5521  df-so 5522  df-fr 5566  df-we 5568  df-xp 5619  df-rel 5620  df-cnv 5621  df-co 5622  df-dm 5623  df-rn 5624  df-res 5625  df-ima 5626  df-pred 6243  df-ord 6304  df-on 6305  df-lim 6306  df-suc 6307  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-ov 7343  df-oprab 7344  df-mpo 7345  df-om 7791  df-2nd 7916  df-frecs 8205  df-wrecs 8236  df-recs 8285  df-rdg 8323  df-oadd 8383  df-omul 8384

This theorem is referenced by:  omword2  8483  oewordri  8501  oeordsuc  8503  omabs2  43322