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

Theorem dmaddpi 10801
Description: Domain of addition on positive integers. (Contributed by NM, 26-Aug-1995.) (New usage is discouraged.)
Assertion
Ref Expression
dmaddpi dom +N = (N × N)

Proof of Theorem dmaddpi
StepHypRef Expression
1 dmres 5971 . . 3 dom ( +o ↾ (N × N)) = ((N × N) ∩ dom +o )
2 fnoa 8435 . . . . 5 +o Fn (On × On)
32fndmi 6596 . . . 4 dom +o = (On × On)
43ineq2i 4169 . . 3 ((N × N) ∩ dom +o ) = ((N × N) ∩ (On × On))
51, 4eqtri 2759 . 2 dom ( +o ↾ (N × N)) = ((N × N) ∩ (On × On))
6 df-pli 10784 . . 3 +N = ( +o ↾ (N × N))
76dmeqi 5853 . 2 dom +N = dom ( +o ↾ (N × N))
8 df-ni 10783 . . . . . . 7 N = (ω ∖ {∅})
9 difss 4088 . . . . . . 7 (ω ∖ {∅}) ⊆ ω
108, 9eqsstri 3980 . . . . . 6 N ⊆ ω
11 omsson 7812 . . . . . 6 ω ⊆ On
1210, 11sstri 3943 . . . . 5 N ⊆ On
13 anidm 564 . . . . 5 ((N ⊆ On ∧ N ⊆ On) ↔ N ⊆ On)
1412, 13mpbir 231 . . . 4 (N ⊆ On ∧ N ⊆ On)
15 xpss12 5639 . . . 4 ((N ⊆ On ∧ N ⊆ On) → (N × N) ⊆ (On × On))
1614, 15ax-mp 5 . . 3 (N × N) ⊆ (On × On)
17 dfss 3920 . . 3 ((N × N) ⊆ (On × On) ↔ (N × N) = ((N × N) ∩ (On × On)))
1816, 17mpbi 230 . 2 (N × N) = ((N × N) ∩ (On × On))
195, 7, 183eqtr4i 2769 1 dom +N = (N × N)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1541  cdif 3898  cin 3900  wss 3901  c0 4285  {csn 4580   × cxp 5622  dom cdm 5624  cres 5626  Oncon0 6317  ωcom 7808   +o coa 8394  Ncnpi 10755   +N cpli 10756
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-oadd 8401  df-ni 10783  df-pli 10784
This theorem is referenced by:  addcompi  10805  addasspi  10806  distrpi  10809  addcanpi  10810  addnidpi  10812  ltapi  10814
  Copyright terms: Public domain W3C validator