| 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 6684 | . . 3 ⊢ 1o ∈ On | |
| 2 | vex 2824 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | omexg 6714 | . . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝐴 ∈ On) → (𝑥 ·o 𝐴) ∈ V) | |
| 4 | 2, 3 | mpan 428 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝑥 ·o 𝐴) ∈ V) |
| 5 | 4 | ralrimivw 2624 | . . . . 5 ⊢ (𝐴 ∈ On → ∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V) |
| 6 | eqid 2238 | . . . . . 6 ⊢ (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) | |
| 7 | 6 | fnmpt 5505 | . . . . 5 ⊢ (∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V) |
| 8 | 5, 7 | syl 14 | . . . 4 ⊢ (𝐴 ∈ On → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V) |
| 9 | rdgexggg 6638 | . . . 4 ⊢ (((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) | |
| 10 | 8, 9 | syl3an1 1311 | . . 3 ⊢ ((𝐴 ∈ On ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) |
| 11 | 1, 10 | mp3an2 1366 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) |
| 12 | oveq2 6083 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 ·o 𝑦) = (𝑥 ·o 𝐴)) | |
| 13 | 12 | mpteq2dv 4217 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ∈ V ↦ (𝑥 ·o 𝑦)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴))) |
| 14 | rdgeq1 6632 | . . . . 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 5692 | . . 3 ⊢ (𝑦 = 𝐴 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧)) |
| 17 | fveq2 5690 | . . 3 ⊢ (𝑧 = 𝐵 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) | |
| 18 | df-oexpi 6683 | . . 3 ⊢ ↑o = (𝑦 ∈ On, 𝑧 ∈ On ↦ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧)) | |
| 19 | 16, 17, 18 | ovmpog 6213 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) → (𝐴 ↑o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) |
| 20 | 11, 19 | mpd3an3 1379 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∀wral 2528 Vcvv 2821 ↦ cmpt 4187 Oncon0 4503 Fn wfn 5367 ‘cfv 5372 (class class class)co 6075 reccrdg 6630 1oc1o 6670 ·o comu 6675 ↑o coei 6676 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-suc 4511 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-irdg 6631 df-1o 6677 df-oadd 6681 df-omul 6682 df-oexpi 6683 |
| This theorem is referenced by: oei0 6722 oeicl 6725 |
| Copyright terms: Public domain | W3C validator |