| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > repsundef | Structured version Visualization version GIF version | ||
| Description: A function mapping a half-open range of nonnegative integers with an upper bound not being a nonnegative integer to a constant is the empty set (in the meaning of "undefined"). (Contributed by AV, 5-Nov-2018.) |
| Ref | Expression |
|---|---|
| repsundef | ⊢ (𝑁 ∉ ℕ0 → (𝑆 repeatS 𝑁) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-reps 14676 | . . 3 ⊢ repeatS = (𝑠 ∈ V, 𝑛 ∈ ℕ0 ↦ (𝑥 ∈ (0..^𝑛) ↦ 𝑠)) | |
| 2 | ovex 7379 | . . . 4 ⊢ (0..^𝑛) ∈ V | |
| 3 | 2 | mptex 7157 | . . 3 ⊢ (𝑥 ∈ (0..^𝑛) ↦ 𝑠) ∈ V |
| 4 | 1, 3 | dmmpo 8003 | . 2 ⊢ dom repeatS = (V × ℕ0) |
| 5 | df-nel 3033 | . . . 4 ⊢ (𝑁 ∉ ℕ0 ↔ ¬ 𝑁 ∈ ℕ0) | |
| 6 | 5 | biimpi 216 | . . 3 ⊢ (𝑁 ∉ ℕ0 → ¬ 𝑁 ∈ ℕ0) |
| 7 | 6 | intnand 488 | . 2 ⊢ (𝑁 ∉ ℕ0 → ¬ (𝑆 ∈ V ∧ 𝑁 ∈ ℕ0)) |
| 8 | ndmovg 7529 | . 2 ⊢ ((dom repeatS = (V × ℕ0) ∧ ¬ (𝑆 ∈ V ∧ 𝑁 ∈ ℕ0)) → (𝑆 repeatS 𝑁) = ∅) | |
| 9 | 4, 7, 8 | sylancr 587 | 1 ⊢ (𝑁 ∉ ℕ0 → (𝑆 repeatS 𝑁) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∉ wnel 3032 Vcvv 3436 ∅c0 4280 ↦ cmpt 5170 × cxp 5612 dom cdm 5614 (class class class)co 7346 0cc0 11006 ℕ0cn0 12381 ..^cfzo 13554 repeatS creps 14675 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pr 5368 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-oprab 7350 df-mpo 7351 df-1st 7921 df-2nd 7922 df-reps 14676 |
| This theorem is referenced by: repswswrd 14691 |
| Copyright terms: Public domain | W3C validator |