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

Theorem naddfn 8681
Description: Natural addition is a function over pairs of ordinals. (Contributed by Scott Fenton, 26-Aug-2024.)
Assertion
Ref Expression
naddfn +no Fn (On × On)

Proof of Theorem naddfn
Dummy variables 𝑤 𝑎 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nadd 8672 . 2 +no = frecs({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (On × On) ∧ 𝑦 ∈ (On × On) ∧ (((1st𝑥) E (1st𝑦) ∨ (1st𝑥) = (1st𝑦)) ∧ ((2nd𝑥) E (2nd𝑦) ∨ (2nd𝑥) = (2nd𝑦)) ∧ 𝑥𝑦))}, (On × On), (𝑧 ∈ V, 𝑎 ∈ V ↦ {𝑤 ∈ On ∣ ((𝑎 “ ({(1st𝑧)} × (2nd𝑧))) ⊆ 𝑤 ∧ (𝑎 “ ((1st𝑧) × {(2nd𝑧)})) ⊆ 𝑤)}))
21on2recsfn 8673 1 +no Fn (On × On)
Colors of variables: wff setvar class
Syntax hints:  wa 395  {crab 3413  Vcvv 3457  wss 3924  {csn 4599   cint 4919   × cxp 5649  cima 5654  Oncon0 6349   Fn wfn 6522  cfv 6527  cmpo 7401  1st c1st 7980  2nd c2nd 7981   +no cnadd 8671
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5246  ax-sep 5263  ax-nul 5273  ax-pow 5332  ax-pr 5399  ax-un 7723
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3358  df-rab 3414  df-v 3459  df-sbc 3764  df-csb 3873  df-dif 3927  df-un 3929  df-in 3931  df-ss 3941  df-pss 3944  df-nul 4307  df-if 4499  df-pw 4575  df-sn 4600  df-pr 4602  df-op 4606  df-uni 4881  df-iun 4966  df-br 5117  df-opab 5179  df-mpt 5199  df-tr 5227  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6287  df-ord 6352  df-on 6353  df-iota 6480  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7402  df-1st 7982  df-2nd 7983  df-frecs 8274  df-nadd 8672
This theorem is referenced by:  naddcllem  8682  naddov2  8685  naddf  8687  naddunif  8699  naddasslem1  8700  naddasslem2  8701
  Copyright terms: Public domain W3C validator