| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dmaddpi | Structured version Visualization version GIF version | ||
| Description: Domain of addition on positive integers. (Contributed by NM, 26-Aug-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dmaddpi | ⊢ dom +N = (N × N) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dmres 6015 | . . 3 ⊢ dom ( +o ↾ (N × N)) = ((N × N) ∩ dom +o ) | |
| 2 | fnoa 8544 | . . . . 5 ⊢ +o Fn (On × On) | |
| 3 | 2 | fndmi 6665 | . . . 4 ⊢ dom +o = (On × On) |
| 4 | 3 | ineq2i 4117 | . . 3 ⊢ ((N × N) ∩ dom +o ) = ((N × N) ∩ (On × On)) |
| 5 | 1, 4 | eqtri 2786 | . 2 ⊢ dom ( +o ↾ (N × N)) = ((N × N) ∩ (On × On)) |
| 6 | df-pli 10985 | . . 3 ⊢ +N = ( +o ↾ (N × N)) | |
| 7 | 6 | dmeqi 5893 | . 2 ⊢ dom +N = dom ( +o ↾ (N × N)) |
| 8 | df-ni 10984 | . . . . . . 7 ⊢ N = (ω ∖ {∅}) | |
| 9 | difss 4075 | . . . . . . 7 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 10 | 8, 9 | eqsstri 3959 | . . . . . 6 ⊢ N ⊆ ω |
| 11 | omsson 7905 | . . . . . 6 ⊢ ω ⊆ On | |
| 12 | 10, 11 | sstri 3922 | . . . . 5 ⊢ N ⊆ On |
| 13 | anidm 575 | . . . . 5 ⊢ ((N ⊆ On ∧ N ⊆ On) ↔ N ⊆ On) | |
| 14 | 12, 13 | mpbir 234 | . . . 4 ⊢ (N ⊆ On ∧ N ⊆ On) |
| 15 | xpss12 5670 | . . . 4 ⊢ ((N ⊆ On ∧ N ⊆ On) → (N × N) ⊆ (On × On)) | |
| 16 | 14, 15 | ax-mp 5 | . . 3 ⊢ (N × N) ⊆ (On × On) |
| 17 | dfss 4098 | . . 3 ⊢ ((N × N) ⊆ (On × On) ↔ (N × N) = ((N × N) ∩ (On × On))) | |
| 18 | 16, 17 | mpbi 233 | . 2 ⊢ (N × N) = ((N × N) ∩ (On × On)) |
| 19 | 5, 7, 18 | 3eqtr4i 2796 | 1 ⊢ dom +N = (N × N) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 ∅c0 4281 {csn 4588 × cxp 5653 dom cdm 5655 ↾ cres 5657 Oncon0 6380 ωcom 7901 +o coa 8501 Ncnpi 10956 +N cpli 10957 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7775 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-oadd 8508 df-ni 10984 df-pli 10985 |
| This theorem is used by: addcompi 11006 addasspi 11007 distrpi 11010 addcanpi 11011 addnidpi 11013 ltapi 11015 |
| Copyright terms: Public domain | W3C validator |