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 16945

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 4331	. . . . . 6 ⊢ ¬ 𝑚 ∈ ∅
2	1	pm2.21i 119	. . . . 5 ⊢ (𝑚 ∈ ∅ → ¬ 𝑥 = (𝐴 + (𝑚 · 𝐷)))
3		risefall0lem 16003	. . . . 5 ⊢ (0...(0 − 1)) = ∅
4	2, 3	eleq2s 2847	. . . 4 ⊢ (𝑚 ∈ (0...(0 − 1)) → ¬ 𝑥 = (𝐴 + (𝑚 · 𝐷)))
5	4	nrex 3071	. . 3 ⊢ ¬ ∃𝑚 ∈ (0...(0 − 1))𝑥 = (𝐴 + (𝑚 · 𝐷))
6		0nn0 12518	. . . 4 ⊢ 0 ∈ ℕ₀
7		vdwapval 16942	. . . 4 ⊢ ((0 ∈ ℕ₀ ∧ 𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝑥 ∈ (𝐴(AP‘0)𝐷) ↔ ∃𝑚 ∈ (0...(0 − 1))𝑥 = (𝐴 + (𝑚 · 𝐷))))
8	6, 7	mp3an1 1445	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝑥 ∈ (𝐴(AP‘0)𝐷) ↔ ∃𝑚 ∈ (0...(0 − 1))𝑥 = (𝐴 + (𝑚 · 𝐷))))
9	5, 8	mtbiri 327	. 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → ¬ 𝑥 ∈ (𝐴(AP‘0)𝐷))
10	9	eq0rdv 4405	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐷 ∈ ℕ) → (𝐴(AP‘0)𝐷) = ∅)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∃wrex 3067 ∅c0 4323 ‘cfv 6548 (class class class)co 7420 0cc0 11139 1c1 11140 + caddc 11142 · cmul 11144 − cmin 11475 ℕcn 12243 ℕ₀cn0 12503 ...cfz 13517 APcvdwa 16934

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-cnex 11195 ax-resscn 11196 ax-1cn 11197 ax-icn 11198 ax-addcl 11199 ax-addrcl 11200 ax-mulcl 11201 ax-mulrcl 11202 ax-mulcom 11203 ax-addass 11204 ax-mulass 11205 ax-distr 11206 ax-i2m1 11207 ax-1ne0 11208 ax-1rid 11209 ax-rnegex 11210 ax-rrecex 11211 ax-cnre 11212 ax-pre-lttri 11213 ax-pre-lttrn 11214 ax-pre-ltadd 11215 ax-pre-mulgt0 11216

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-1st 7993 df-2nd 7994 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11281 df-mnf 11282 df-xr 11283 df-ltxr 11284 df-le 11285 df-sub 11477 df-neg 11478 df-nn 12244 df-n0 12504 df-z 12590 df-uz 12854 df-fz 13518 df-vdwap 16937

This theorem is referenced by: vdwap1 16946 vdwmc2 16948 vdwlem13 16962

W3C validator