![]() |
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 14718 | . . 3 ⊢ repeatS = (𝑠 ∈ V, 𝑛 ∈ ℕ0 ↦ (𝑥 ∈ (0..^𝑛) ↦ 𝑠)) | |
2 | ovex 7441 | . . . 4 ⊢ (0..^𝑛) ∈ V | |
3 | 2 | mptex 7224 | . . 3 ⊢ (𝑥 ∈ (0..^𝑛) ↦ 𝑠) ∈ V |
4 | 1, 3 | dmmpo 8056 | . 2 ⊢ dom repeatS = (V × ℕ0) |
5 | df-nel 3047 | . . . 4 ⊢ (𝑁 ∉ ℕ0 ↔ ¬ 𝑁 ∈ ℕ0) | |
6 | 5 | biimpi 215 | . . 3 ⊢ (𝑁 ∉ ℕ0 → ¬ 𝑁 ∈ ℕ0) |
7 | 6 | intnand 489 | . 2 ⊢ (𝑁 ∉ ℕ0 → ¬ (𝑆 ∈ V ∧ 𝑁 ∈ ℕ0)) |
8 | ndmovg 7589 | . 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 396 = wceq 1541 ∈ wcel 2106 ∉ wnel 3046 Vcvv 3474 ∅c0 4322 ↦ cmpt 5231 × cxp 5674 dom cdm 5676 (class class class)co 7408 0cc0 11109 ℕ0cn0 12471 ..^cfzo 13626 repeatS creps 14717 |
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-pr 5427 ax-un 7724 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 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-nul 4323 df-if 4529 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-id 5574 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-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7974 df-2nd 7975 df-reps 14718 |
This theorem is referenced by: repswswrd 14733 |
Copyright terms: Public domain | W3C validator |