Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  oeiv GIF version

Theorem oeiv 6359
 Description: Value of ordinal exponentiation. (Contributed by Jim Kingdon, 9-Jul-2019.)
Assertion
Ref Expression
oeiv ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵))
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem oeiv
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1on 6327 . . 3 1o ∈ On
2 vex 2692 . . . . . . 7 𝑥 ∈ V
3 omexg 6354 . . . . . . 7 ((𝑥 ∈ V ∧ 𝐴 ∈ On) → (𝑥 ·o 𝐴) ∈ V)
42, 3mpan 421 . . . . . 6 (𝐴 ∈ On → (𝑥 ·o 𝐴) ∈ V)
54ralrimivw 2509 . . . . 5 (𝐴 ∈ On → ∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V)
6 eqid 2140 . . . . . 6 (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴))
76fnmpt 5256 . . . . 5 (∀𝑥 ∈ V (𝑥 ·o 𝐴) ∈ V → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V)
85, 7syl 14 . . . 4 (𝐴 ∈ On → (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V)
9 rdgexggg 6281 . . . 4 (((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) Fn V ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V)
108, 9syl3an1 1250 . . 3 ((𝐴 ∈ On ∧ 1o ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V)
111, 10mp3an2 1304 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V)
12 oveq2 5789 . . . . . 6 (𝑦 = 𝐴 → (𝑥 ·o 𝑦) = (𝑥 ·o 𝐴))
1312mpteq2dv 4026 . . . . 5 (𝑦 = 𝐴 → (𝑥 ∈ V ↦ (𝑥 ·o 𝑦)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)))
14 rdgeq1 6275 . . . . 5 ((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)) = (𝑥 ∈ V ↦ (𝑥 ·o 𝐴)) → rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o) = rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o))
1513, 14syl 14 . . . 4 (𝑦 = 𝐴 → rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o) = rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o))
1615fveq1d 5430 . . 3 (𝑦 = 𝐴 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧))
17 fveq2 5428 . . 3 (𝑧 = 𝐵 → (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝑧) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵))
18 df-oexpi 6326 . . 3 o = (𝑦 ∈ On, 𝑧 ∈ On ↦ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝑦)), 1o)‘𝑧))
1916, 17, 18ovmpog 5912 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵) ∈ V) → (𝐴o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵))
2011, 19mpd3an3 1317 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 ·o 𝐴)), 1o)‘𝐵))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   = wceq 1332   ∈ wcel 1481  ∀wral 2417  Vcvv 2689   ↦ cmpt 3996  Oncon0 4292   Fn wfn 5125  ‘cfv 5130  (class class class)co 5781  reccrdg 6273  1oc1o 6313   ·o comu 6318   ↑o coei 6319 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4050  ax-sep 4053  ax-nul 4061  ax-pow 4105  ax-pr 4138  ax-un 4362  ax-setind 4459 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2913  df-csb 3007  df-dif 3077  df-un 3079  df-in 3081  df-ss 3088  df-nul 3368  df-pw 3516  df-sn 3537  df-pr 3538  df-op 3540  df-uni 3744  df-iun 3822  df-br 3937  df-opab 3997  df-mpt 3998  df-tr 4034  df-id 4222  df-iord 4295  df-on 4297  df-suc 4300  df-xp 4552  df-rel 4553  df-cnv 4554  df-co 4555  df-dm 4556  df-rn 4557  df-res 4558  df-ima 4559  df-iota 5095  df-fun 5132  df-fn 5133  df-f 5134  df-f1 5135  df-fo 5136  df-f1o 5137  df-fv 5138  df-ov 5784  df-oprab 5785  df-mpo 5786  df-1st 6045  df-2nd 6046  df-recs 6209  df-irdg 6274  df-1o 6320  df-oadd 6324  df-omul 6325  df-oexpi 6326 This theorem is referenced by:  oei0  6362  oeicl  6365
 Copyright terms: Public domain W3C validator