| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > oeiv | GIF version | ||
| Description: Value of ordinal exponentiation. (Contributed by Jim Kingdon, 9-Jul-2019.) |
| Ref | Expression |
|---|---|
| oeiv | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1on 6632 | . . 3 ⊢ 1o ∈ On | |
| 2 | vex 2806 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | omexg 6662 | . . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝐴 ∈ On) → (𝑥 ·o 𝐴) ∈ V) | |
| 4 | 2, 3 | mpan 424 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝑥 ·o 𝐴) ∈ V) |
| 5 | 4 | ralrimivw 2607 | . . . . 5 ⊢ (𝐴 ∈ On → ∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V) |
| 6 | eqid 2231 | . . . . . 6 ⊢ (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) | |
| 7 | 6 | fnmpt 5466 | . . . . 5 ⊢ (∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V) |
| 8 | 5, 7 | syl 14 | . . . 4 ⊢ (𝐴 ∈ On → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V) |
| 9 | rdgexggg 6586 | . . . 4 ⊢ (((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) | |
| 10 | 8, 9 | syl3an1 1307 | . . 3 ⊢ ((𝐴 ∈ On ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) |
| 11 | 1, 10 | mp3an2 1362 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) |
| 12 | oveq2 6036 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 ·o 𝑦) = (𝑥 ·o 𝐴)) | |
| 13 | 12 | mpteq2dv 4185 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ∈ V ↦ (𝑥 ·o 𝑦)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴))) |
| 14 | rdgeq1 6580 | . . . . 5 ⊢ ((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) → rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o) = rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)) | |
| 15 | 13, 14 | syl 14 | . . . 4 ⊢ (𝑦 = 𝐴 → rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o) = rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)) |
| 16 | 15 | fveq1d 5650 | . . 3 ⊢ (𝑦 = 𝐴 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧)) |
| 17 | fveq2 5648 | . . 3 ⊢ (𝑧 = 𝐵 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) | |
| 18 | df-oexpi 6631 | . . 3 ⊢ ↑o = (𝑦 ∈ On, 𝑧 ∈ On ↦ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧)) | |
| 19 | 16, 17, 18 | ovmpog 6166 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) → (𝐴 ↑o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) |
| 20 | 11, 19 | mpd3an3 1375 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 ∀wral 2511 Vcvv 2803 ↦ cmpt 4155 Oncon0 4466 Fn wfn 5328 ‘cfv 5333 (class class class)co 6028 reccrdg 6578 1oc1o 6618 ·o comu 6623 ↑o coei 6624 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-suc 4474 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-1o 6625 df-oadd 6629 df-omul 6630 df-oexpi 6631 |
| This theorem is referenced by: oei0 6670 oeicl 6673 |
| Copyright terms: Public domain | W3C validator |