| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vdwapf | Structured version Visualization version GIF version | ||
| Description: The arithmetic progression function is a function. (Contributed by Mario Carneiro, 18-Aug-2014.) |
| Ref | Expression |
|---|---|
| vdwapf | ⊢ (𝐾 ∈ ℕ0 → (AP‘𝐾):(ℕ × ℕ)⟶𝒫 ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 778 | . . . . . . . 8 ⊢ (((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑎 ∈ ℕ) | |
| 2 | elfznn0 13648 | . . . . . . . . . 10 ⊢ (𝑚 ∈ (0...(𝐾 − 1)) → 𝑚 ∈ ℕ0) | |
| 3 | 2 | adantl 486 | . . . . . . . . 9 ⊢ (((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑚 ∈ ℕ0) |
| 4 | nnnn0 12511 | . . . . . . . . . 10 ⊢ (𝑑 ∈ ℕ → 𝑑 ∈ ℕ0) | |
| 5 | 4 | ad2antlr 739 | . . . . . . . . 9 ⊢ (((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑑 ∈ ℕ0) |
| 6 | 3, 5 | nn0mulcld 12570 | . . . . . . . 8 ⊢ (((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑚 · 𝑑) ∈ ℕ0) |
| 7 | nnnn0addcl 12534 | . . . . . . . 8 ⊢ ((𝑎 ∈ ℕ ∧ (𝑚 · 𝑑) ∈ ℕ0) → (𝑎 + (𝑚 · 𝑑)) ∈ ℕ) | |
| 8 | 1, 6, 7 | syl2anc 595 | . . . . . . 7 ⊢ (((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑎 + (𝑚 · 𝑑)) ∈ ℕ) |
| 9 | 8 | fmpttd 7111 | . . . . . 6 ⊢ ((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) → (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))):(0...(𝐾 − 1))⟶ℕ) |
| 10 | 9 | frnd 6715 | . . . . 5 ⊢ ((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) → ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))) ⊆ ℕ) |
| 11 | nnex 12239 | . . . . . 6 ⊢ ℕ ∈ V | |
| 12 | 11 | elpw2 5305 | . . . . 5 ⊢ (ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))) ∈ 𝒫 ℕ ↔ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))) ⊆ ℕ) |
| 13 | 10, 12 | sylibr 237 | . . . 4 ⊢ ((𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) → ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))) ∈ 𝒫 ℕ) |
| 14 | 13 | rgen2 3211 | . . 3 ⊢ ∀𝑎 ∈ ℕ ∀𝑑 ∈ ℕ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))) ∈ 𝒫 ℕ |
| 15 | eqid 2769 | . . . 4 ⊢ (𝑎 ∈ ℕ, 𝑑 ∈ ℕ ↦ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑)))) = (𝑎 ∈ ℕ, 𝑑 ∈ ℕ ↦ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑)))) | |
| 16 | 15 | fmpo 8065 | . . 3 ⊢ (∀𝑎 ∈ ℕ ∀𝑑 ∈ ℕ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))) ∈ 𝒫 ℕ ↔ (𝑎 ∈ ℕ, 𝑑 ∈ ℕ ↦ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑)))):(ℕ × ℕ)⟶𝒫 ℕ) |
| 17 | 14, 16 | mpbi 233 | . 2 ⊢ (𝑎 ∈ ℕ, 𝑑 ∈ ℕ ↦ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑)))):(ℕ × ℕ)⟶𝒫 ℕ |
| 18 | vdwapfval 17031 | . . 3 ⊢ (𝐾 ∈ ℕ0 → (AP‘𝐾) = (𝑎 ∈ ℕ, 𝑑 ∈ ℕ ↦ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑))))) | |
| 19 | 18 | feq1d 6688 | . 2 ⊢ (𝐾 ∈ ℕ0 → ((AP‘𝐾):(ℕ × ℕ)⟶𝒫 ℕ ↔ (𝑎 ∈ ℕ, 𝑑 ∈ ℕ ↦ ran (𝑚 ∈ (0...(𝐾 − 1)) ↦ (𝑎 + (𝑚 · 𝑑)))):(ℕ × ℕ)⟶𝒫 ℕ)) |
| 20 | 17, 19 | mpbiri 261 | 1 ⊢ (𝐾 ∈ ℕ0 → (AP‘𝐾):(ℕ × ℕ)⟶𝒫 ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2149 ∀wral 3085 ⊆ wss 3913 𝒫 cpw 4567 ↦ cmpt 5196 × cxp 5660 ran crn 5663 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 0cc0 11100 1c1 11101 + caddc 11103 · cmul 11105 − cmin 11441 ℕcn 12233 ℕ0cn0 12504 ...cfz 13535 APcvdwa 17025 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 df-vdwap 17028 |
| This theorem is referenced by: vdwmc 17038 |
| Copyright terms: Public domain | W3C validator |