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

Theorem oalim 8565
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 6443 . . 3 ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → 𝐵 ∈ On)
2 simpr 490 . . 3 ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → Lim 𝐵)
31, 2jca 521 . 2 ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → (𝐵 ∈ On ∧ Lim 𝐵))
4 rdglim2a 8466 . . . 4 ((𝐵 ∈ On ∧ Lim 𝐵) → (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
54adantl 487 . . 3 ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))
6 oav 8544 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵))
7 onelon 6402 . . . . . . . 8 ((𝐵 ∈ On ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
8 oav 8544 . . . . . . . 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 2779 . . . 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 2147  Vcvv 3454  ∪ ciun 4954   ↦ cmpt 5189  Oncon0 6377  Lim wlim 6378  suc csuc 6379  ‘cfv 6555  (class class class)co 7440  reccrdg 8442   +o coa 8498
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-oadd 8505
This theorem is used by:  oacl  8568  oa0r  8571  oaordi  8579  oawordri  8583  oawordeulem  8587  oalimcl  8593  oaass  8594  oarec  8595  odi  8612  oeoalem  8630  oaabslem  8681  oaabs2  8683  oa0suclim  44467  naddgeoa  44586  naddwordnexlem4  44593
  Copyright terms: Public domain W3C validator