| 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 6509 | . . 3 ⊢ 1o ∈ On | |
| 2 | vex 2775 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | omexg 6537 | . . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝐴 ∈ On) → (𝑥 ·o 𝐴) ∈ V) | |
| 4 | 2, 3 | mpan 424 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝑥 ·o 𝐴) ∈ V) |
| 5 | 4 | ralrimivw 2580 | . . . . 5 ⊢ (𝐴 ∈ On → ∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V) |
| 6 | eqid 2205 | . . . . . 6 ⊢ (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) | |
| 7 | 6 | fnmpt 5402 | . . . . 5 ⊢ (∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V) |
| 8 | 5, 7 | syl 14 | . . . 4 ⊢ (𝐴 ∈ On → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V) |
| 9 | rdgexggg 6463 | . . . 4 ⊢ (((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) | |
| 10 | 8, 9 | syl3an1 1283 | . . 3 ⊢ ((𝐴 ∈ On ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) |
| 11 | 1, 10 | mp3an2 1338 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) |
| 12 | oveq2 5952 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 ·o 𝑦) = (𝑥 ·o 𝐴)) | |
| 13 | 12 | mpteq2dv 4135 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ∈ V ↦ (𝑥 ·o 𝑦)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴))) |
| 14 | rdgeq1 6457 | . . . . 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 5578 | . . 3 ⊢ (𝑦 = 𝐴 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧)) |
| 17 | fveq2 5576 | . . 3 ⊢ (𝑧 = 𝐵 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) | |
| 18 | df-oexpi 6508 | . . 3 ⊢ ↑o = (𝑦 ∈ On, 𝑧 ∈ On ↦ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧)) | |
| 19 | 16, 17, 18 | ovmpog 6080 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) → (𝐴 ↑o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) |
| 20 | 11, 19 | mpd3an3 1351 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2176 ∀wral 2484 Vcvv 2772 ↦ cmpt 4105 Oncon0 4410 Fn wfn 5266 ‘cfv 5271 (class class class)co 5944 reccrdg 6455 1oc1o 6495 ·o comu 6500 ↑o coei 6501 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-coll 4159 ax-sep 4162 ax-nul 4170 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-ral 2489 df-rex 2490 df-reu 2491 df-rab 2493 df-v 2774 df-sbc 2999 df-csb 3094 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-nul 3461 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-iun 3929 df-br 4045 df-opab 4106 df-mpt 4107 df-tr 4143 df-id 4340 df-iord 4413 df-on 4415 df-suc 4418 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-res 4687 df-ima 4688 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-f1 5276 df-fo 5277 df-f1o 5278 df-fv 5279 df-ov 5947 df-oprab 5948 df-mpo 5949 df-1st 6226 df-2nd 6227 df-recs 6391 df-irdg 6456 df-1o 6502 df-oadd 6506 df-omul 6507 df-oexpi 6508 |
| This theorem is referenced by: oei0 6545 oeicl 6548 |
| Copyright terms: Public domain | W3C validator |