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

Theorem omv2 6558
Description: Value of ordinal multiplication. (Contributed by Jim Kingdon, 23-Aug-2019.)
Assertion
Ref Expression
omv2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem omv2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 omfnex 6542 . . . 4 (𝐴 ∈ On → (𝑦 ∈ V ↦ (𝑦 +o 𝐴)) Fn V)
2 0elon 4443 . . . . 5 ∅ ∈ On
3 rdgival 6475 . . . . 5 (((𝑦 ∈ V ↦ (𝑦 +o 𝐴)) Fn V ∧ ∅ ∈ On ∧ 𝐵 ∈ On) → (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = (∅ ∪ 𝑥𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))))
42, 3mp3an2 1338 . . . 4 (((𝑦 ∈ V ↦ (𝑦 +o 𝐴)) Fn V ∧ 𝐵 ∈ On) → (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = (∅ ∪ 𝑥𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))))
51, 4sylan 283 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = (∅ ∪ 𝑥𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))))
6 omv 6548 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵))
7 onelon 4435 . . . . . . 7 ((𝐵 ∈ On ∧ 𝑥𝐵) → 𝑥 ∈ On)
8 omexg 6544 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ·o 𝑥) ∈ V)
9 omcl 6554 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ·o 𝑥) ∈ On)
10 simpl 109 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → 𝐴 ∈ On)
11 oacl 6553 . . . . . . . . . 10 (((𝐴 ·o 𝑥) ∈ On ∧ 𝐴 ∈ On) → ((𝐴 ·o 𝑥) +o 𝐴) ∈ On)
129, 10, 11syl2anc 411 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝐴 ·o 𝑥) +o 𝐴) ∈ On)
13 oveq1 5958 . . . . . . . . . 10 (𝑦 = (𝐴 ·o 𝑥) → (𝑦 +o 𝐴) = ((𝐴 ·o 𝑥) +o 𝐴))
14 eqid 2206 . . . . . . . . . 10 (𝑦 ∈ V ↦ (𝑦 +o 𝐴)) = (𝑦 ∈ V ↦ (𝑦 +o 𝐴))
1513, 14fvmptg 5662 . . . . . . . . 9 (((𝐴 ·o 𝑥) ∈ V ∧ ((𝐴 ·o 𝑥) +o 𝐴) ∈ On) → ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(𝐴 ·o 𝑥)) = ((𝐴 ·o 𝑥) +o 𝐴))
168, 12, 15syl2anc 411 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(𝐴 ·o 𝑥)) = ((𝐴 ·o 𝑥) +o 𝐴))
17 omv 6548 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ·o 𝑥) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))
1817fveq2d 5587 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(𝐴 ·o 𝑥)) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
1916, 18eqtr3d 2241 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝐴 ·o 𝑥) +o 𝐴) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
207, 19sylan2 286 . . . . . 6 ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ 𝑥𝐵)) → ((𝐴 ·o 𝑥) +o 𝐴) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
2120anassrs 400 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑥𝐵) → ((𝐴 ·o 𝑥) +o 𝐴) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
2221iuneq2dv 3950 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴) = 𝑥𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
2322uneq2d 3328 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∪ 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴)) = (∅ ∪ 𝑥𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))))
245, 6, 233eqtr4d 2249 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (∅ ∪ 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴)))
25 uncom 3318 . . 3 (∅ ∪ 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴)) = ( 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴) ∪ ∅)
26 un0 3495 . . 3 ( 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴) ∪ ∅) = 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴)
2725, 26eqtri 2227 . 2 (∅ ∪ 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴)) = 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴)
2824, 27eqtrdi 2255 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = 𝑥𝐵 ((𝐴 ·o 𝑥) +o 𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  wcel 2177  Vcvv 2773  cun 3165  c0 3461   ciun 3929  cmpt 4109  Oncon0 4414   Fn wfn 5271  cfv 5276  (class class class)co 5951  reccrdg 6462   +o coa 6506   ·o comu 6507
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-id 4344  df-iord 4417  df-on 4419  df-suc 4422  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-recs 6398  df-irdg 6463  df-oadd 6513  df-omul 6514
This theorem is referenced by:  omsuc  6565
  Copyright terms: Public domain W3C validator