| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > omlim | Structured version Visualization version GIF version | ||
| Description: Ordinal multiplication with a limit ordinal. Definition 8.15 of [TakeutiZaring] p. 62. Definition 2.5 of [Schloeder] p. 4. (Contributed by NM, 3-Aug-2004.) (Revised by Mario Carneiro, 8-Sep-2013.) |
| Ref | Expression |
|---|---|
| omlim | ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ 𝐶 ∧ Lim 𝐵)) → (𝐴 ·o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ·o 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | limelon 6421 | . . 3 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → 𝐵 ∈ On) | |
| 2 | simpr 490 | . . 3 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → Lim 𝐵) | |
| 3 | 1, 2 | jca 521 | . 2 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → (𝐵 ∈ On ∧ Lim 𝐵)) |
| 4 | rdglim2a 8425 | . . . 4 ⊢ ((𝐵 ∈ On ∧ Lim 𝐵) → (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)) | |
| 5 | 4 | adantl 487 | . . 3 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)) |
| 6 | omv 8504 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵)) | |
| 7 | onelon 6380 | . . . . . . . 8 ⊢ ((𝐵 ∈ On ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On) | |
| 8 | omv 8504 | . . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ·o 𝑥) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)) | |
| 9 | 7, 8 | sylan2 605 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ 𝑥 ∈ 𝐵)) → (𝐴 ·o 𝑥) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)) |
| 10 | 9 | anassrs 473 | . . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑥 ∈ 𝐵) → (𝐴 ·o 𝑥) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)) |
| 11 | 10 | iuneq2dv 4976 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐵 (𝐴 ·o 𝑥) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)) |
| 12 | 6, 11 | eqeq12d 2777 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ·o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ·o 𝑥) ↔ (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))) |
| 13 | 12 | adantrr 730 | . . 3 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → ((𝐴 ·o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ·o 𝑥) ↔ (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = ∪ 𝑥 ∈ 𝐵 (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))) |
| 14 | 5, 13 | mpbird 260 | . 2 ⊢ ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ Lim 𝐵)) → (𝐴 ·o 𝐵) = ∪ 𝑥 ∈ 𝐵 (𝐴 ·o 𝑥)) |
| 15 | 3, 14 | sylan2 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 3451 ∅c0 4279 ∪ ciun 4951 ↦ cmpt 5186 Oncon0 6355 Lim wlim 6356 ‘cfv 6531 (class class class)co 7412 reccrdg 8401 +o coa 8457 ·o comu 8458 |
| 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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7740 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-omul 8465 |
| This theorem is used by: omcl 8528 om0r 8531 om1r 8535 omordi 8558 omwordri 8564 omordlim 8569 omlimcl 8570 odi 8571 omass 8572 omeulem1 8574 oeoalem 8589 oeoelem 8591 omabslem 8643 omabs 8644 om0suclim 44236 oaabsb 44254 |
| Copyright terms: Public domain | W3C validator |