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

Theorem oalim 8522
Description: Ordinal addition with a limit ordinal. Definition 8.1 of [TakeutiZaring] p. 56. Definition 2.3 of [Schloeder] p. 4. (Contributed by NM, 3-Aug-2004.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
oalim ((𝐴 ∈ On ∧ (𝐵𝐶 ∧ Lim 𝐵)) → (𝐴 +o 𝐵) = 𝑥𝐵 (𝐴 +o 𝑥))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem oalim
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 limelon 6427 . . 3 ((𝐵𝐶 ∧ Lim 𝐵) → 𝐵 ∈ On)
2 simpr 490 . . 3 ((𝐵𝐶 ∧ Lim 𝐵) → Lim 𝐵)
31, 2jca 521 . 2 ((𝐵𝐶 ∧ Lim 𝐵) → (𝐵 ∈ On ∧ Lim 𝐵))
4 rdglim2a 8425 . . . 4 ((𝐵 ∈ On ∧ Lim 𝐵) → (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = 𝑥𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
54adantl 487 . . 3 ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = 𝑥𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
6 oav 8501 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵))
7 onelon 6386 . . . . . . . 8 ((𝐵 ∈ On ∧ 𝑥𝐵) → 𝑥 ∈ On)
8 oav 8501 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 +o 𝑥) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
97, 8sylan2 605 . . . . . . 7 ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ 𝑥𝐵)) → (𝐴 +o 𝑥) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
109anassrs 473 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑥𝐵) → (𝐴 +o 𝑥) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
1110iuneq2dv 4979 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝑥𝐵 (𝐴 +o 𝑥) = 𝑥𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
126, 11eqeq12d 2778 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = 𝑥𝐵 (𝐴 +o 𝑥) ↔ (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = 𝑥𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)))
1312adantrr 730 . . 3 ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → ((𝐴 +o 𝐵) = 𝑥𝐵 (𝐴 +o 𝑥) ↔ (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = 𝑥𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)))
145, 13mpbird 260 . 2 ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → (𝐴 +o 𝐵) = 𝑥𝐵 (𝐴 +o 𝑥))
153, 14sylan2 605 1 ((𝐴 ∈ On ∧ (𝐵𝐶 ∧ Lim 𝐵)) → (𝐴 +o 𝐵) = 𝑥𝐵 (𝐴 +o 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  Vcvv 3453   ciun 4954  cmpt 5190  Oncon0 6361  Lim wlim 6362  suc csuc 6363  cfv 6537  (class class class)co 7416  reccrdg 8401   +o coa 8455
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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 7419  df-oprab 7420  df-mpo 7421  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-oadd 8462
This theorem is used by:  oacl  8525  oa0r  8528  oaordi  8536  oawordri  8540  oawordeulem  8544  oalimcl  8550  oaass  8551  oarec  8552  odi  8569  oeoalem  8587  oaabslem  8638  oaabs2  8640  oa0suclim  44101  naddgeoa  44220  naddwordnexlem4  44227
  Copyright terms: Public domain W3C validator