Theorem omwordri 8536

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 7395	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐴 ·o 𝑥) = (𝐴 ·o ∅))
2		oveq2 7395	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐵 ·o 𝑥) = (𝐵 ·o ∅))
3	1, 2	sseq12d 3980	. . . . 5 ⊢ (𝑥 = ∅ → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅)))
4		oveq2 7395	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑦))
5		oveq2 7395	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝑦))
6	4, 5	sseq12d 3980	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦)))
7		oveq2 7395	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o suc 𝑦))
8		oveq2 7395	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o suc 𝑦))
9	7, 8	sseq12d 3980	. . . . 5 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦)))
10		oveq2 7395	. . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝐶))
11		oveq2 7395	. . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝐶))
12	10, 11	sseq12d 3980	. . . . 5 ⊢ (𝑥 = 𝐶 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
13		om0 8481	. . . . . . 7 ⊢ (𝐴 ∈ On → (𝐴 ·o ∅) = ∅)
14		0ss 4363	. . . . . . 7 ⊢ ∅ ⊆ (𝐵 ·o ∅)
15	13, 14	eqsstrdi 3991	. . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅))
16	15	ad2antrr 726	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅))
17		omcl 8500	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o 𝑦) ∈ On)
18	17	3adant2 1131	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o 𝑦) ∈ On)
19		omcl 8500	. . . . . . . . . . . . . 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 8514	. . . . . . . . . . . . 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 8513	. . . . . . . . . . . . 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 3957	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵))
31		omsuc 8490	. . . . . . . . . . 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 8490	. . . . . . . . . . 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 4002	. . . . . . . 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 3451	. . . . . . . 8 ⊢ 𝑥 ∈ V
42		ss2iun 4974	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
43		omlim 8497	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦))
44	43	ad2ant2rl 749	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (𝐴 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦))
45		omlim 8497	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
46	45	adantl 481	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (𝐵 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
47	44, 46	sseq12d 3980	. . . . . . . . . 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 7841	. . . 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 3447   ⊆ wss 3914  ∅c0 4296  ∪ ciun 4955  Oncon0 6332  Lim wlim 6333  suc csuc 6334  (class class class)co 7387   +_o coa 8431   ·_o comu 8432

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 5234  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

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 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-oadd 8438  df-omul 8439

This theorem is referenced by:  omword2  8538  oewordri  8556  oeordsuc  8558  omabs2  43321