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

Theorem oawordri 8549
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 7416 . . . . 5 (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅))
2 oveq2 7416 . . . . 5 (𝑥 = ∅ → (𝐵 +o 𝑥) = (𝐵 +o ∅))
31, 2sseq12d 4015 . . . 4 (𝑥 = ∅ → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o ∅) ⊆ (𝐵 +o ∅)))
4 oveq2 7416 . . . . 5 (𝑥 = 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o 𝑦))
5 oveq2 7416 . . . . 5 (𝑥 = 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o 𝑦))
64, 5sseq12d 4015 . . . 4 (𝑥 = 𝑦 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦)))
7 oveq2 7416 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o suc 𝑦))
8 oveq2 7416 . . . . 5 (𝑥 = suc 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o suc 𝑦))
97, 8sseq12d 4015 . . . 4 (𝑥 = suc 𝑦 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
10 oveq2 7416 . . . . 5 (𝑥 = 𝐶 → (𝐴 +o 𝑥) = (𝐴 +o 𝐶))
11 oveq2 7416 . . . . 5 (𝑥 = 𝐶 → (𝐵 +o 𝑥) = (𝐵 +o 𝐶))
1210, 11sseq12d 4015 . . . 4 (𝑥 = 𝐶 → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
13 oa0 8515 . . . . . . 7 (𝐴 ∈ On → (𝐴 +o ∅) = 𝐴)
1413adantr 481 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o ∅) = 𝐴)
15 oa0 8515 . . . . . . 7 (𝐵 ∈ On → (𝐵 +o ∅) = 𝐵)
1615adantl 482 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o ∅) = 𝐵)
1714, 16sseq12d 4015 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o ∅) ⊆ (𝐵 +o ∅) ↔ 𝐴𝐵))
1817biimpar 478 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +o ∅) ⊆ (𝐵 +o ∅))
19 oacl 8534 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +o 𝑦) ∈ On)
20 eloni 6374 . . . . . . . . . . 11 ((𝐴 +o 𝑦) ∈ On → Ord (𝐴 +o 𝑦))
2119, 20syl 17 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐴 +o 𝑦))
22 oacl 8534 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +o 𝑦) ∈ On)
23 eloni 6374 . . . . . . . . . . 11 ((𝐵 +o 𝑦) ∈ On → Ord (𝐵 +o 𝑦))
2422, 23syl 17 . . . . . . . . . 10 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → Ord (𝐵 +o 𝑦))
25 ordsucsssuc 7810 . . . . . . . . . 10 ((Ord (𝐴 +o 𝑦) ∧ Ord (𝐵 +o 𝑦)) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
2621, 24, 25syl2an 596 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝑦 ∈ On) ∧ (𝐵 ∈ On ∧ 𝑦 ∈ On)) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
2726anandirs 677 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
28 oasuc 8523 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
2928adantlr 713 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
30 oasuc 8523 . . . . . . . . . 10 ((𝐵 ∈ On ∧ 𝑦 ∈ On) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
3130adantll 712 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
3229, 31sseq12d 4015 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦) ↔ suc (𝐴 +o 𝑦) ⊆ suc (𝐵 +o 𝑦)))
3327, 32bitr4d 281 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) ↔ (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
3433biimpd 228 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦)))
3534expcom 414 . . . . 5 (𝑦 ∈ On → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦))))
3635adantrd 492 . . . 4 (𝑦 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → ((𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o suc 𝑦) ⊆ (𝐵 +o suc 𝑦))))
37 vex 3478 . . . . . . 7 𝑥 ∈ V
38 ss2iun 5015 . . . . . . . 8 (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → 𝑦𝑥 (𝐴 +o 𝑦) ⊆ 𝑦𝑥 (𝐵 +o 𝑦))
39 oalim 8531 . . . . . . . . . 10 ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +o 𝑥) = 𝑦𝑥 (𝐴 +o 𝑦))
4039adantlr 713 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +o 𝑥) = 𝑦𝑥 (𝐴 +o 𝑦))
41 oalim 8531 . . . . . . . . . 10 ((𝐵 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +o 𝑥) = 𝑦𝑥 (𝐵 +o 𝑦))
4241adantll 712 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐵 +o 𝑥) = 𝑦𝑥 (𝐵 +o 𝑦))
4340, 42sseq12d 4015 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → ((𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥) ↔ 𝑦𝑥 (𝐴 +o 𝑦) ⊆ 𝑦𝑥 (𝐵 +o 𝑦)))
4438, 43imbitrrid 245 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥)))
4537, 44mpanr1 701 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ Lim 𝑥) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥)))
4645expcom 414 . . . . 5 (Lim 𝑥 → ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥))))
4746adantrd 492 . . . 4 (Lim 𝑥 → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (∀𝑦𝑥 (𝐴 +o 𝑦) ⊆ (𝐵 +o 𝑦) → (𝐴 +o 𝑥) ⊆ (𝐵 +o 𝑥))))
483, 6, 9, 12, 18, 36, 47tfinds3 7853 . . 3 (𝐶 ∈ On → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
4948exp4c 433 . 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 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3061  Vcvv 3474  wss 3948  c0 4322   ciun 4997  Ord word 6363  Oncon0 6364  Lim wlim 6365  suc csuc 6366  (class class class)co 7408   +o coa 8462
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7724
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7855  df-2nd 7975  df-frecs 8265  df-wrecs 8296  df-recs 8370  df-rdg 8409  df-oadd 8469
This theorem is referenced by:  oaword2  8552  omwordri  8571  oaabs2  8647  omabs2  42072  oaun3lem2  42115  naddwordnexlem4  42142
  Copyright terms: Public domain W3C validator