![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > vdwap1 | Structured version Visualization version GIF version |
Description: Value of a length-1 arithmetic progression. (Contributed by Mario Carneiro, 18-Aug-2014.) |
Ref | Expression |
---|---|
vdwap1 | ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘1)𝐷) = {𝐴}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1e0p1 12718 | . . . . 5 ⊢ 1 = (0 + 1) | |
2 | 1 | fveq2i 6885 | . . . 4 ⊢ (AP‘1) = (AP‘(0 + 1)) |
3 | 2 | oveqi 7415 | . . 3 ⊢ (𝐴(AP‘1)𝐷) = (𝐴(AP‘(0 + 1))𝐷) |
4 | 0nn0 12486 | . . . 4 ⊢ 0 ∈ ℕ0 | |
5 | vdwapun 16912 | . . . 4 ⊢ ((0 ∈ ℕ0 ∧ 𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘(0 + 1))𝐷) = ({𝐴} ∪ ((𝐴 + 𝐷)(AP‘0)𝐷))) | |
6 | 4, 5 | mp3an1 1444 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘(0 + 1))𝐷) = ({𝐴} ∪ ((𝐴 + 𝐷)(AP‘0)𝐷))) |
7 | 3, 6 | eqtrid 2776 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘1)𝐷) = ({𝐴} ∪ ((𝐴 + 𝐷)(AP‘0)𝐷))) |
8 | nnaddcl 12234 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴 + 𝐷) ∈ ℕ) | |
9 | vdwap0 16914 | . . . . 5 ⊢ (((𝐴 + 𝐷) ∈ ℕ ∧ 𝐷 ∈ ℕ) → ((𝐴 + 𝐷)(AP‘0)𝐷) = ∅) | |
10 | 8, 9 | sylancom 587 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → ((𝐴 + 𝐷)(AP‘0)𝐷) = ∅) |
11 | 10 | uneq2d 4156 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → ({𝐴} ∪ ((𝐴 + 𝐷)(AP‘0)𝐷)) = ({𝐴} ∪ ∅)) |
12 | un0 4383 | . . 3 ⊢ ({𝐴} ∪ ∅) = {𝐴} | |
13 | 11, 12 | eqtrdi 2780 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → ({𝐴} ∪ ((𝐴 + 𝐷)(AP‘0)𝐷)) = {𝐴}) |
14 | 7, 13 | eqtrd 2764 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘1)𝐷) = {𝐴}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∪ cun 3939 ∅c0 4315 {csn 4621 ‘cfv 6534 (class class class)co 7402 0cc0 11107 1c1 11108 + caddc 11110 ℕcn 12211 ℕ0cn0 12471 APcvdwa 16903 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5276 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-pss 3960 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-tr 5257 df-id 5565 df-eprel 5571 df-po 5579 df-so 5580 df-fr 5622 df-we 5624 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-pred 6291 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-om 7850 df-1st 7969 df-2nd 7970 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-n0 12472 df-z 12558 df-uz 12822 df-fz 13486 df-vdwap 16906 |
This theorem is referenced by: vdwlem12 16930 vdwlem13 16931 |
Copyright terms: Public domain | W3C validator |