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

Theorem naddfn 8613
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 8604 . 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 8605 1 +no Fn (On × On)
Colors of variables: wff setvar class
Syntax hints:  wa 395  {crab 3401  Vcvv 3442  wss 3903  {csn 4582   cint 4904   × cxp 5630  cima 5635  Oncon0 6325   Fn wfn 6495  cfv 6500  cmpo 7370  1st c1st 7941  2nd c2nd 7942   +no cnadd 8603
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-1st 7943  df-2nd 7944  df-frecs 8233  df-nadd 8604
This theorem is referenced by:  naddcllem  8614  naddov2  8617  naddf  8619  naddunif  8631  naddasslem1  8632  naddasslem2  8633
  Copyright terms: Public domain W3C validator