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

Theorem oawordri 7517
Description: Weak ordering property of ordinal addition. Proposition 8.7 of [TakeutiZaring] p. 59. (Contributed by NM, 7-Dec-2004.)
Assertion
Ref Expression
oawordri ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 → (𝐴 +𝑜 𝐶) ⊆ (𝐵 +𝑜 𝐶)))

Proof of Theorem oawordri
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 6557 . . . . . 6 (𝑥 = ∅ → (𝐴 +𝑜 𝑥) = (𝐴 +𝑜 ∅))
2 oveq2 6557 . . . . . 6 (𝑥 = ∅ → (𝐵 +𝑜 𝑥) = (𝐵 +𝑜 ∅))
31, 2sseq12d 3597 . . . . 5 (𝑥 = ∅ → ((𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥) ↔ (𝐴 +𝑜 ∅) ⊆ (𝐵 +𝑜 ∅)))
4 oveq2 6557 . . . . . 6 (𝑥 = 𝑦 → (𝐴 +𝑜 𝑥) = (𝐴 +𝑜 𝑦))
5 oveq2 6557 . . . . . 6 (𝑥 = 𝑦 → (𝐵 +𝑜 𝑥) = (𝐵 +𝑜 𝑦))
64, 5sseq12d 3597 . . . . 5 (𝑥 = 𝑦 → ((𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥) ↔ (𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦)))
7 oveq2 6557 . . . . . 6 (𝑥 = suc 𝑦 → (𝐴 +𝑜 𝑥) = (𝐴 +𝑜 suc 𝑦))
8 oveq2 6557 . . . . . 6 (𝑥 = suc 𝑦 → (𝐵 +𝑜 𝑥) = (𝐵 +𝑜 suc 𝑦))
97, 8sseq12d 3597 . . . . 5 (𝑥 = suc 𝑦 → ((𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥) ↔ (𝐴 +𝑜 suc 𝑦) ⊆ (𝐵 +𝑜 suc 𝑦)))
10 oveq2 6557 . . . . . 6 (𝑥 = 𝐶 → (𝐴 +𝑜 𝑥) = (𝐴 +𝑜 𝐶))
11 oveq2 6557 . . . . . 6 (𝑥 = 𝐶 → (𝐵 +𝑜 𝑥) = (𝐵 +𝑜 𝐶))
1210, 11sseq12d 3597 . . . . 5 (𝑥 = 𝐶 → ((𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥) ↔ (𝐴 +𝑜 𝐶) ⊆ (𝐵 +𝑜 𝐶)))
13 oa0 7483 . . . . . . . 8 (𝐴 ∈ On → (𝐴 +𝑜 ∅) = 𝐴)
1413adantr 480 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +𝑜 ∅) = 𝐴)
15 oa0 7483 . . . . . . . 8 (𝐵 ∈ On → (𝐵 +𝑜 ∅) = 𝐵)
1615adantl 481 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +𝑜 ∅) = 𝐵)
1714, 16sseq12d 3597 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +𝑜 ∅) ⊆ (𝐵 +𝑜 ∅) ↔ 𝐴𝐵))
1817biimpar 501 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +𝑜 ∅) ⊆ (𝐵 +𝑜 ∅))
19 oacl 7502 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +𝑜 𝑦) ∈ On)
20 eloni 5650 . . . . . . . . . . . 12 ((𝐴 +𝑜 𝑦) ∈ On → Ord (𝐴 +𝑜 𝑦))
2119, 20syl 17 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐴 +𝑜 𝑦))
22 oacl 7502 . . . . . . . . . . . 12 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +𝑜 𝑦) ∈ On)
23 eloni 5650 . . . . . . . . . . . 12 ((𝐵 +𝑜 𝑦) ∈ On → Ord (𝐵 +𝑜 𝑦))
2422, 23syl 17 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐵 +𝑜 𝑦))
25 ordsucsssuc 6915 . . . . . . . . . . 11 ((Ord (𝐴 +𝑜 𝑦) ∧ Ord (𝐵 +𝑜 𝑦)) → ((𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) ↔ suc (𝐴 +𝑜 𝑦) ⊆ suc (𝐵 +𝑜 𝑦)))
2621, 24, 25syl2an 493 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐵 ∈ On ∧ 𝑦 ∈ On)) → ((𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) ↔ suc (𝐴 +𝑜 𝑦) ⊆ suc (𝐵 +𝑜 𝑦)))
2726anandirs 870 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) ↔ suc (𝐴 +𝑜 𝑦) ⊆ suc (𝐵 +𝑜 𝑦)))
28 oasuc 7491 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +𝑜 suc 𝑦) = suc (𝐴 +𝑜 𝑦))
2928adantlr 747 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐴 +𝑜 suc 𝑦) = suc (𝐴 +𝑜 𝑦))
30 oasuc 7491 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +𝑜 suc 𝑦) = suc (𝐵 +𝑜 𝑦))
3130adantll 746 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐵 +𝑜 suc 𝑦) = suc (𝐵 +𝑜 𝑦))
3229, 31sseq12d 3597 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +𝑜 suc 𝑦) ⊆ (𝐵 +𝑜 suc 𝑦) ↔ suc (𝐴 +𝑜 𝑦) ⊆ suc (𝐵 +𝑜 𝑦)))
3327, 32bitr4d 270 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) ↔ (𝐴 +𝑜 suc 𝑦) ⊆ (𝐵 +𝑜 suc 𝑦)))
3433biimpd 218 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → (𝐴 +𝑜 suc 𝑦) ⊆ (𝐵 +𝑜 suc 𝑦)))
3534expcom 450 . . . . . 6 (𝑦 ∈ On → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → (𝐴 +𝑜 suc 𝑦) ⊆ (𝐵 +𝑜 suc 𝑦))))
3635adantrd 483 . . . . 5 (𝑦 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → ((𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → (𝐴 +𝑜 suc 𝑦) ⊆ (𝐵 +𝑜 suc 𝑦))))
37 vex 3176 . . . . . . . 8 𝑥 ∈ V
38 ss2iun 4472 . . . . . . . . 9 (∀𝑦𝑥 (𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → 𝑦𝑥 (𝐴 +𝑜 𝑦) ⊆ 𝑦𝑥 (𝐵 +𝑜 𝑦))
39 oalim 7499 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +𝑜 𝑥) = 𝑦𝑥 (𝐴 +𝑜 𝑦))
4039adantlr 747 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +𝑜 𝑥) = 𝑦𝑥 (𝐴 +𝑜 𝑦))
41 oalim 7499 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +𝑜 𝑥) = 𝑦𝑥 (𝐵 +𝑜 𝑦))
4241adantll 746 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +𝑜 𝑥) = 𝑦𝑥 (𝐵 +𝑜 𝑦))
4340, 42sseq12d 3597 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → ((𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥) ↔ 𝑦𝑥 (𝐴 +𝑜 𝑦) ⊆ 𝑦𝑥 (𝐵 +𝑜 𝑦)))
4438, 43syl5ibr 235 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (∀𝑦𝑥 (𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → (𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥)))
4537, 44mpanr1 715 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ Lim 𝑥) → (∀𝑦𝑥 (𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → (𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥)))
4645expcom 450 . . . . . 6 (Lim 𝑥 → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∀𝑦𝑥 (𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → (𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥))))
4746adantrd 483 . . . . 5 (Lim 𝑥 → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (∀𝑦𝑥 (𝐴 +𝑜 𝑦) ⊆ (𝐵 +𝑜 𝑦) → (𝐴 +𝑜 𝑥) ⊆ (𝐵 +𝑜 𝑥))))
483, 6, 9, 12, 18, 36, 47tfinds3 6956 . . . 4 (𝐶 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +𝑜 𝐶) ⊆ (𝐵 +𝑜 𝐶)))
4948exp4c 634 . . 3 (𝐶 ∈ On → (𝐴 ∈ On → (𝐵 ∈ On → (𝐴𝐵 → (𝐴 +𝑜 𝐶) ⊆ (𝐵 +𝑜 𝐶)))))
5049com3l 87 . 2 (𝐴 ∈ On → (𝐵 ∈ On → (𝐶 ∈ On → (𝐴𝐵 → (𝐴 +𝑜 𝐶) ⊆ (𝐵 +𝑜 𝐶)))))
51503imp 1249 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 → (𝐴 +𝑜 𝐶) ⊆ (𝐵 +𝑜 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wral 2896  Vcvv 3173  wss 3540  c0 3874   ciun 4455  Ord word 5639  Oncon0 5640  Lim wlim 5641  suc csuc 5642  (class class class)co 6549   +𝑜 coa 7444
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-oadd 7451
This theorem is referenced by:  oaword2  7520  omwordri  7539  oaabs2  7612
  Copyright terms: Public domain W3C validator