MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnom Structured version   Visualization version   GIF version

Theorem fnom 8567
Description: Functionality and domain of ordinal multiplication. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
fnom ·o Fn (On × On)

Proof of Theorem fnom
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-omul 8529 . 2 ·o = (𝑥 ∈ On, 𝑦 ∈ On ↦ (rec((𝑧 ∈ V ↦ (𝑧 +o 𝑥)), ∅)‘𝑦))
2 fvex 6935 . 2 (rec((𝑧 ∈ V ↦ (𝑧 +o 𝑥)), ∅)‘𝑦) ∈ V
31, 2fnmpoi 8113 1 ·o Fn (On × On)
Colors of variables: wff setvar class
Syntax hints:  Vcvv 3488  c0 4352  cmpt 5249   × cxp 5698  Oncon0 6397   Fn wfn 6570  cfv 6575  (class class class)co 7450  reccrdg 8467   +o coa 8521   ·o comu 8522
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7772
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6527  df-fun 6577  df-fn 6578  df-f 6579  df-fv 6583  df-oprab 7454  df-mpo 7455  df-1st 8032  df-2nd 8033  df-omul 8529
This theorem is referenced by:  om0x  8577  dmmulpi  10962
  Copyright terms: Public domain W3C validator