| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oalim | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| oalim | ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ 𝐶 ∧ Lim 𝐵)) → (𝐴 +o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 +o 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | limelon 6371 | . . 3 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → 𝐵 ∈ On) | |
| 2 | simpr 484 | . . 3 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → Lim 𝐵) | |
| 3 | 1, 2 | jca 511 | . 2 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → (𝐵 ∈ On ∧ Lim 𝐵)) |
| 4 | rdglim2a 8352 | . . . 4 ⊢ ((𝐵 ∈ On ∧ Lim 𝐵) → (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)) | |
| 5 | 4 | adantl 481 | . . 3 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)) |
| 6 | oav 8426 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵)) | |
| 7 | onelon 6331 | . . . . . . . 8 ⊢ ((𝐵 ∈ On ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On) | |
| 8 | oav 8426 | . . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 +o 𝑥) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)) | |
| 9 | 7, 8 | sylan2 593 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ 𝑥 ∈ 𝐵)) → (𝐴 +o 𝑥) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)) |
| 10 | 9 | anassrs 467 | . . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑥 ∈ 𝐵) → (𝐴 +o 𝑥) = (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)) |
| 11 | 10 | iuneq2dv 4964 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐵 (𝐴 +o 𝑥) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥)) |
| 12 | 6, 11 | eqeq12d 2747 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 +o 𝑥) ↔ (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))) |
| 13 | 12 | adantrr 717 | . . 3 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → ((𝐴 +o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 +o 𝑥) ↔ (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ suc 𝑦), 𝐴)‘𝑥))) |
| 14 | 5, 13 | mpbird 257 | . 2 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → (𝐴 +o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 +o 𝑥)) |
| 15 | 3, 14 | sylan2 593 | 1 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ 𝐶 ∧ Lim 𝐵)) → (𝐴 +o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 +o 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 Vcvv 3436 ∪ ciun 4939 ↦ cmpt 5170 Oncon0 6306 Lim wlim 6307 suc csuc 6308 ‘cfv 6481 (class class class)co 7346 reccrdg 8328 +o coa 8382 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pr 5368 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-oprab 7350 df-mpo 7351 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-oadd 8389 |
| This theorem is referenced by: oacl 8450 oa0r 8453 oaordi 8461 oawordri 8465 oawordeulem 8469 oalimcl 8475 oaass 8476 oarec 8477 odi 8494 oeoalem 8511 oaabslem 8562 oaabs2 8564 oa0suclim 43367 naddgeoa 43486 naddwordnexlem4 43493 |
| Copyright terms: Public domain | W3C validator |