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

Theorem oawordri 8479
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) → (𝐴𝐵 → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))

Proof of Theorem oawordri
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7367 . . . . 5 (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅))
2 oveq2 7367 . . . . 5 (𝑥 = ∅ → (𝐵 +o 𝑥) = (𝐵 +o ∅))
31, 2sseq12d 3949 . . . 4 (𝑥 = ∅ → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o ∅) ⊆ (𝐵 +o ∅)))
4 oveq2 7367 . . . . 5 (𝑥 = 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o 𝑦))
5 oveq2 7367 . . . . 5 (𝑥 = 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o 𝑦))
64, 5sseq12d 3949 . . . 4 (𝑥 = 𝑦 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦)))
7 oveq2 7367 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o suc 𝑦))
8 oveq2 7367 . . . . 5 (𝑥 = suc 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o suc 𝑦))
97, 8sseq12d 3949 . . . 4 (𝑥 = suc 𝑦 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
10 oveq2 7367 . . . . 5 (𝑥 = 𝐶 → (𝐴 +o 𝑥) = (𝐴 +o 𝐶))
11 oveq2 7367 . . . . 5 (𝑥 = 𝐶 → (𝐵 +o 𝑥) = (𝐵 +o 𝐶))
1210, 11sseq12d 3949 . . . 4 (𝑥 = 𝐶 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
13 oa0 8445 . . . . . . 7 (𝐴 ∈ On → (𝐴 +o ∅) = 𝐴)
1413adantr 482 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o ∅) = 𝐴)
15 oa0 8445 . . . . . . 7 (𝐵 ∈ On → (𝐵 +o ∅) = 𝐵)
1615adantl 483 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o ∅) = 𝐵)
1714, 16sseq12d 3949 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o ∅) ⊆ (𝐵 +o ∅) ↔ 𝐴𝐵))
1817biimpar 479 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +o ∅) ⊆ (𝐵 +o ∅))
19 oacl 8464 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +o 𝑦) ∈ On)
20 eloni 6323 . . . . . . . . . . 11 ((𝐴 +o 𝑦) ∈ On → Ord (𝐴 +o 𝑦))
2119, 20syl 17 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐴 +o 𝑦))
22 oacl 8464 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +o 𝑦) ∈ On)
23 eloni 6323 . . . . . . . . . . 11 ((𝐵 +o 𝑦) ∈ On → Ord (𝐵 +o 𝑦))
2422, 23syl 17 . . . . . . . . . 10 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐵 +o 𝑦))
25 ordsucsssuc 7766 . . . . . . . . . 10 ((Ord (𝐴 +o 𝑦) ∧ Ord (𝐵 +o 𝑦)) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
2621, 24, 25syl2an 603 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐵 ∈ On ∧ 𝑦 ∈ On)) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
2726anandirs 686 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
28 oasuc 8453 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
2928adantlr 722 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
30 oasuc 8453 . . . . . . . . . 10 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
3130adantll 721 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
3229, 31sseq12d 3949 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
3327, 32bitr4d 284 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
3433biimpd 231 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
3534expcom 415 . . . . 5 (𝑦 ∈ On → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦))))
3635adantrd 493 . . . 4 (𝑦 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦))))
37 vex 3437 . . . . . . 7 𝑥 ∈ V
38 ss2iun 4942 . . . . . . . 8 (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → 𝑦𝑥 (𝐴 +o 𝑦) ⊆ 𝑦𝑥 (𝐵 +o 𝑦))
39 oalim 8461 . . . . . . . . . 10 ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +o 𝑥) = 𝑦𝑥 (𝐴 +o 𝑦))
4039adantlr 722 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +o 𝑥) = 𝑦𝑥 (𝐴 +o 𝑦))
41 oalim 8461 . . . . . . . . . 10 ((𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +o 𝑥) = 𝑦𝑥 (𝐵 +o 𝑦))
4241adantll 721 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +o 𝑥) = 𝑦𝑥 (𝐵 +o 𝑦))
4340, 42sseq12d 3949 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ 𝑦𝑥 (𝐴 +o 𝑦) ⊆ 𝑦𝑥 (𝐵 +o 𝑦)))
4438, 43imbitrrid 248 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥)))
4537, 44mpanr1 710 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ Lim 𝑥) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥)))
4645expcom 415 . . . . 5 (Lim 𝑥 → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥))))
4746adantrd 493 . . . 4 (Lim 𝑥 → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥))))
483, 6, 9, 12, 18, 36, 47tfinds3 7808 . . 3 (𝐶 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
4948exp4c 434 . 2 (𝐶 ∈ On → (𝐴 ∈ On → (𝐵 ∈ On → (𝐴𝐵 → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))))
50493imp231 1119 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397  w3a 1093   = wceq 1548  wcel 2121  wral 3055  Vcvv 3433  wss 3884  c0 4263   ciun 4923  Ord word 6312  Oncon0 6313  Lim wlim 6314  suc csuc 6315  (class class class)co 7359   +o coa 8396
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pr 5364  ax-un 7681
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3904  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-ov 7362  df-oprab 7363  df-mpo 7364  df-om 7810  df-2nd 7934  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8343  df-oadd 8403
This theorem is referenced by:  oaword2  8482  omwordri  8501  oaabs2  8579  omabs2  43790  oaun3lem2  43833  naddwordnexlem4  43859
  Copyright terms: Public domain W3C validator