vdwap0 - Metamath Proof Explorer

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

Theorem vdwap0 16908

Description: Value of a length-1 arithmetic progression. (Contributed by Mario Carneiro, 18-Aug-2014.)

**Assertion**
Ref	Expression
vdwap0	⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘0)𝐷) = ∅)

Proof of Theorem vdwap0 Dummy variables 𝑚 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		noel 4330	. . . . . 6 ⊢ ¬ 𝑚 ∈ ∅
2	1	pm2.21i 119	. . . . 5 ⊢ (𝑚 ∈ ∅ → ¬ 𝑥 = (𝐴 + (𝑚 · 𝐷)))
3		risefall0lem 15969	. . . . 5 ⊢ (0...(0 − 1)) = ∅
4	2, 3	eleq2s 2851	. . . 4 ⊢ (𝑚 ∈ (0...(0 − 1)) → ¬ 𝑥 = (𝐴 + (𝑚 · 𝐷)))
5	4	nrex 3074	. . 3 ⊢ ¬ ∃𝑚 ∈ (0...(0 − 1))𝑥 = (𝐴 + (𝑚 · 𝐷))
6		0nn0 12486	. . . 4 ⊢ 0 ∈ ℕ₀
7		vdwapval 16905	. . . 4 ⊢ ((0 ∈ ℕ₀ ∧ 𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝑥 ∈ (𝐴(AP‘0)𝐷) ↔ ∃𝑚 ∈ (0...(0 − 1))𝑥 = (𝐴 + (𝑚 · 𝐷))))
8	6, 7	mp3an1 1448	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝑥 ∈ (𝐴(AP‘0)𝐷) ↔ ∃𝑚 ∈ (0...(0 − 1))𝑥 = (𝐴 + (𝑚 · 𝐷))))
9	5, 8	mtbiri 326	. 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → ¬ 𝑥 ∈ (𝐴(AP‘0)𝐷))
10	9	eq0rdv 4404	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘0)𝐷) = ∅)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∃wrex 3070 ∅c0 4322 ‘cfv 6543 (class class class)co 7408 0cc0 11109 1c1 11110 + caddc 11112 · cmul 11114 − cmin 11443 ℕcn 12211 ℕ₀cn0 12471 ...cfz 13483 APcvdwa 16897

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 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 13484 df-vdwap 16900

This theorem is referenced by: vdwap1 16909 vdwmc2 16911 vdwlem13 16925

W3C validator