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

Theorem omv2 6742
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 6726 . . . 4 (𝐴 ∈ On → (𝑦 ∈ V ↦ (𝑦 +o 𝐴)) Fn V)
2 0elon 4539 . . . . 5 ∅ ∈ On
3 rdgival 6657 . . . . 5 (((𝑦 ∈ V ↦ (𝑦 +o 𝐴)) Fn V ∧ ∅ ∈ On ∧ 𝐵 ∈ On) → (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵) = (∅ ∪ ∪ 𝑥 ∈ 𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))))
42, 3mp3an2 1366 . . . 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 6732 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝐵))
7 onelon 4531 . . . . . . 7 ((𝐵 ∈ On ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
8 omexg 6728 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ·o 𝑥) ∈ V)
9 omcl 6738 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ·o 𝑥) ∈ On)
10 simpl 109 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → 𝐴 ∈ On)
11 oacl 6737 . . . . . . . . . 10 (((𝐴 ·o 𝑥) ∈ On ∧ 𝐴 ∈ On) → ((𝐴 ·o 𝑥) +o 𝐴) ∈ On)
129, 10, 11syl2anc 415 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝐴 ·o 𝑥) +o 𝐴) ∈ On)
13 oveq1 6095 . . . . . . . . . 10 (𝑦 = (𝐴 ·o 𝑥) → (𝑦 +o 𝐴) = ((𝐴 ·o 𝑥) +o 𝐴))
14 eqid 2238 . . . . . . . . . 10 (𝑦 ∈ V ↦ (𝑦 +o 𝐴)) = (𝑦 ∈ V ↦ (𝑦 +o 𝐴))
1513, 14fvmptg 5784 . . . . . . . . 9 (((𝐴 ·o 𝑥) ∈ V ∧ ((𝐴 ·o 𝑥) +o 𝐴) ∈ On) → ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(𝐴 ·o 𝑥)) = ((𝐴 ·o 𝑥) +o 𝐴))
168, 12, 15syl2anc 415 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(𝐴 ·o 𝑥)) = ((𝐴 ·o 𝑥) +o 𝐴))
17 omv 6732 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ·o 𝑥) = (rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))
1817fveq2d 5702 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(𝐴 ·o 𝑥)) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
1916, 18eqtr3d 2273 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ((𝐴 ·o 𝑥) +o 𝐴) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
207, 19sylan2 286 . . . . . 6 ((𝐴 ∈ On ∧ (𝐵 ∈ On ∧ 𝑥 ∈ 𝐵)) → ((𝐴 ·o 𝑥) +o 𝐴) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
2120anassrs 404 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑥 ∈ 𝐵) → ((𝐴 ·o 𝑥) +o 𝐴) = ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
2221iuneq2dv 4033 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴) = ∪ 𝑥 ∈ 𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥)))
2322uneq2d 3383 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∪ ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴)) = (∅ ∪ ∪ 𝑥 ∈ 𝐵 ((𝑦 ∈ V ↦ (𝑦 +o 𝐴))‘(rec((𝑦 ∈ V ↦ (𝑦 +o 𝐴)), ∅)‘𝑥))))
245, 6, 233eqtr4d 2281 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (∅ ∪ ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴)))
25 uncom 3373 . . 3 (∅ ∪ ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴)) = (∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴) ∪ ∅)
26 un0 3556 . . 3 (∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴) ∪ ∅) = ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴)
2725, 26eqtri 2259 . 2 (∅ ∪ ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴)) = ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴)
2824, 27eqtrdi 2287 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = ∪ 𝑥 ∈ 𝐵 ((𝐴 ·o 𝑥) +o 𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  Vcvv 2821   ∪ cun 3218  ∅c0 3520  ∪ ciun 4012   ↦ cmpt 4193  Oncon0 4510   Fn wfn 5375  ‘cfv 5380  (class class class)co 6088  reccrdg 6644   +o coa 6688   ·o comu 6689
This proof depends on 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-oadd 6695  df-omul 6696
This theorem is used by:  omsuc  6749
  Copyright terms: Public domain W3C validator