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 7368 . . . . 5 (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅))
2 oveq2 7368 . . . . 5 (𝑥 = ∅ → (𝐵 +o 𝑥) = (𝐵 +o ∅))
31, 2sseq12d 3968 . . . 4 (𝑥 = ∅ → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o ∅) ⊆ (𝐵 +o ∅)))
4 oveq2 7368 . . . . 5 (𝑥 = 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o 𝑦))
5 oveq2 7368 . . . . 5 (𝑥 = 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o 𝑦))
64, 5sseq12d 3968 . . . 4 (𝑥 = 𝑦 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦)))
7 oveq2 7368 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o suc 𝑦))
8 oveq2 7368 . . . . 5 (𝑥 = suc 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o suc 𝑦))
97, 8sseq12d 3968 . . . 4 (𝑥 = suc 𝑦 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
10 oveq2 7368 . . . . 5 (𝑥 = 𝐶 → (𝐴 +o 𝑥) = (𝐴 +o 𝐶))
11 oveq2 7368 . . . . 5 (𝑥 = 𝐶 → (𝐵 +o 𝑥) = (𝐵 +o 𝐶))
1210, 11sseq12d 3968 . . . 4 (𝑥 = 𝐶 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
13 oa0 8445 . . . . . . 7 (𝐴 ∈ On → (𝐴 +o ∅) = 𝐴)
1413adantr 480 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o ∅) = 𝐴)
15 oa0 8445 . . . . . . 7 (𝐵 ∈ On → (𝐵 +o ∅) = 𝐵)
1615adantl 481 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o ∅) = 𝐵)
1714, 16sseq12d 3968 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o ∅) ⊆ (𝐵 +o ∅) ↔ 𝐴𝐵))
1817biimpar 477 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +o ∅) ⊆ (𝐵 +o ∅))
19 oacl 8464 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +o 𝑦) ∈ On)
20 eloni 6328 . . . . . . . . . . 11 ((𝐴 +o 𝑦) ∈ On → Ord (𝐴 +o 𝑦))
2119, 20syl 17 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐴 +o 𝑦))
22 oacl 8464 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +o 𝑦) ∈ On)
23 eloni 6328 . . . . . . . . . . 11 ((𝐵 +o 𝑦) ∈ On → Ord (𝐵 +o 𝑦))
2422, 23syl 17 . . . . . . . . . 10 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐵 +o 𝑦))
25 ordsucsssuc 7767 . . . . . . . . . 10 ((Ord (𝐴 +o 𝑦) ∧ Ord (𝐵 +o 𝑦)) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
2621, 24, 25syl2an 597 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐵 ∈ On ∧ 𝑦 ∈ On)) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
2726anandirs 680 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
28 oasuc 8453 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
2928adantlr 716 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
30 oasuc 8453 . . . . . . . . . 10 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
3130adantll 715 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
3229, 31sseq12d 3968 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
3327, 32bitr4d 282 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
3433biimpd 229 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
3534expcom 413 . . . . 5 (𝑦 ∈ On → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦))))
3635adantrd 491 . . . 4 (𝑦 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦))))
37 vex 3445 . . . . . . 7 𝑥 ∈ V
38 ss2iun 4966 . . . . . . . 8 (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → 𝑦𝑥 (𝐴 +o 𝑦) ⊆ 𝑦𝑥 (𝐵 +o 𝑦))
39 oalim 8461 . . . . . . . . . 10 ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +o 𝑥) = 𝑦𝑥 (𝐴 +o 𝑦))
4039adantlr 716 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +o 𝑥) = 𝑦𝑥 (𝐴 +o 𝑦))
41 oalim 8461 . . . . . . . . . 10 ((𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +o 𝑥) = 𝑦𝑥 (𝐵 +o 𝑦))
4241adantll 715 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +o 𝑥) = 𝑦𝑥 (𝐵 +o 𝑦))
4340, 42sseq12d 3968 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ 𝑦𝑥 (𝐴 +o 𝑦) ⊆ 𝑦𝑥 (𝐵 +o 𝑦)))
4438, 43imbitrrid 246 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥)))
4537, 44mpanr1 704 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ Lim 𝑥) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥)))
4645expcom 413 . . . . 5 (Lim 𝑥 → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥))))
4746adantrd 491 . . . 4 (Lim 𝑥 → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥))))
483, 6, 9, 12, 18, 36, 47tfinds3 7809 . . 3 (𝐶 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
4948exp4c 432 . 2 (𝐶 ∈ On → (𝐴 ∈ On → (𝐵 ∈ On → (𝐴𝐵 → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))))
50493imp231 1113 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  Vcvv 3441  wss 3902  c0 4286   ciun 4947  Ord word 6317  Oncon0 6318  Lim wlim 6319  suc csuc 6320  (class class class)co 7360   +o coa 8396
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-oadd 8403
This theorem is referenced by:  oaword2  8482  omwordri  8501  oaabs2  8579  omabs2  43641  oaun3lem2  43684  naddwordnexlem4  43710
  Copyright terms: Public domain W3C validator