MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  omwordri Structured version   Visualization version   GIF version

Theorem omwordri 8573
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.
StepHypRef Expression
1 oveq2 7426 . . . . . 6 (𝑥 = ∅ → (𝐴 ·o 𝑥) = (𝐴 ·o ∅))
2 oveq2 7426 . . . . . 6 (𝑥 = ∅ → (𝐵 ·o 𝑥) = (𝐵 ·o ∅))
31, 2sseq12d 3964 . . . . 5 (𝑥 = ∅ → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅)))
4 oveq2 7426 . . . . . 6 (𝑥 = 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑦))
5 oveq2 7426 . . . . . 6 (𝑥 = 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝑦))
64, 5sseq12d 3964 . . . . 5 (𝑥 = 𝑦 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦)))
7 oveq2 7426 . . . . . 6 (𝑥 = suc 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o suc 𝑦))
8 oveq2 7426 . . . . . 6 (𝑥 = suc 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o suc 𝑦))
97, 8sseq12d 3964 . . . . 5 (𝑥 = suc 𝑦 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦)))
10 oveq2 7426 . . . . . 6 (𝑥 = 𝐶 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝐶))
11 oveq2 7426 . . . . . 6 (𝑥 = 𝐶 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝐶))
1210, 11sseq12d 3964 . . . . 5 (𝑥 = 𝐶 → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
13 om0 8518 . . . . . . 7 (𝐴 ∈ On → (𝐴 ·o ∅) = ∅)
14 0ss 4350 . . . . . . 7 ∅ ⊆ (𝐵 ·o ∅)
1513, 14eqsstrdi 3975 . . . . . 6 (𝐴 ∈ On → (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅))
1615ad2antrr 739 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ·o ∅) ⊆ (𝐵 ·o ∅))
17 omcl 8537 . . . . . . . . . . . . . 14 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o 𝑦) ∈ On)
18173adant2 1149 . . . . . . . . . . . . 13 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o 𝑦) ∈ On)
19 omcl 8537 . . . . . . . . . . . . . 14 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o 𝑦) ∈ On)
20193adant1 1148 . . . . . . . . . . . . 13 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o 𝑦) ∈ On)
21 simp1 1154 . . . . . . . . . . . . 13 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → 𝐴 ∈ On)
22 oawordri 8551 . . . . . . . . . . . . 13 (((𝐴 ·o 𝑦) ∈ On ∧ (𝐵 ·o 𝑦) ∈ On ∧ 𝐴 ∈ On) → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴)))
2318, 20, 21, 22syl3anc 1398 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴)))
2423imp 412 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦)) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴))
2524adantrl 729 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐴))
26 oaword 8550 . . . . . . . . . . . . 13 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ (𝐵 ·o 𝑦) ∈ On) → (𝐴 ⊆ 𝐵 ↔ ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵)))
2720, 26syld3an3 1436 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ⊆ 𝐵 ↔ ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵)))
2827biimpa 482 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ 𝐴 ⊆ 𝐵) → ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵))
2928adantrr 730 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → ((𝐵 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵))
3025, 29sstrd 3941 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → ((𝐴 ·o 𝑦) +o 𝐴) ⊆ ((𝐵 ·o 𝑦) +o 𝐵))
31 omsuc 8527 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴))
32313adant2 1149 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴))
3332adantr 486 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴))
34 omsuc 8527 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
35343adant1 1148 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
3635adantr 486 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
3730, 33, 363sstr4d 3986 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐴 ⊆ 𝐵 ∧ (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦))) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))
3837exp520 1376 . . . . . . 7 (𝐴 ∈ On → (𝐵 ∈ On → (𝑦 ∈ On → (𝐴 ⊆ 𝐵 → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))))))
3938com3r 88 . . . . . 6 (𝑦 ∈ On → (𝐴 ∈ On → (𝐵 ∈ On → (𝐴 ⊆ 𝐵 → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))))))
4039imp4c 429 . . . . 5 (𝑦 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → ((𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o suc 𝑦) ⊆ (𝐵 ·o suc 𝑦))))
41 vex 3455 . . . . . . . 8 𝑥 ∈ V
42 ss2iun 4970 . . . . . . . . . 10 (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
43 omlim 8534 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦))
4443ad2ant2rl 762 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (𝐴 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦))
45 omlim 8534 . . . . . . . . . . . 12 ((𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
4645adantl 487 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (𝐵 ·o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦))
4744, 46sseq12d 3964 . . . . . . . . . 10 (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → ((𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥) ↔ ∪ 𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ ∪ 𝑦 ∈ 𝑥 (𝐵 ·o 𝑦)))
4842, 47imbitrrid 249 . . . . . . . . 9 (((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) ∧ (𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥))) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥)))
4948anandirs 692 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥)))
5041, 49mpanr1 716 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ Lim 𝑥) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥)))
5150expcom 419 . . . . . 6 (Lim 𝑥 → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥))))
5251adantrd 497 . . . . 5 (Lim 𝑥 → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (∀𝑦 ∈ 𝑥 (𝐴 ·o 𝑦) ⊆ (𝐵 ·o 𝑦) → (𝐴 ·o 𝑥) ⊆ (𝐵 ·o 𝑥))))
533, 6, 9, 12, 16, 40, 52tfinds3 7874 . . . 4 (𝐶 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
5453expd 421 . . 3 (𝐶 ∈ On → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶))))
55543impib 1134 . 2 ((𝐶 ∈ On ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
56553coml 1145 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐴 ·o 𝐶) ⊆ (𝐵 ·o 𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  ∪ ciun 4951  Oncon0 6361  Lim wlim 6362  suc csuc 6363  (class class class)co 7418   +o coa 8466   ·o comu 8467
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-oadd 8473  df-omul 8474
This theorem is used by:  omword2  8575  oewordri  8594  oeordsuc  8596  omabs2  44318
  Copyright terms: Public domain W3C validator