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

Theorem repsundef 14743
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.)
Assertion
Ref Expression
repsundef (𝑁 ∉ ℕ0 → (𝑆 repeatS 𝑁) = ∅)

Proof of Theorem repsundef
Dummy variables 𝑛 𝑠 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-reps 14741 . . 3 repeatS = (𝑠 ∈ V, 𝑛 ∈ ℕ0 ↦ (𝑥 ∈ (0..^𝑛) ↦ 𝑠))
2 ovex 7423 . . . 4 (0..^𝑛) ∈ V
32mptex 7200 . . 3 (𝑥 ∈ (0..^𝑛) ↦ 𝑠) ∈ V
41, 3dmmpo 8053 . 2 dom repeatS = (V × ℕ0)
5 df-nel 3031 . . . 4 (𝑁 ∉ ℕ0 ↔ ¬ 𝑁 ∈ ℕ0)
65biimpi 216 . . 3 (𝑁 ∉ ℕ0 → ¬ 𝑁 ∈ ℕ0)
76intnand 488 . 2 (𝑁 ∉ ℕ0 → ¬ (𝑆 ∈ V ∧ 𝑁 ∈ ℕ0))
8 ndmovg 7575 . 2 ((dom repeatS = (V × ℕ0) ∧ ¬ (𝑆 ∈ V ∧ 𝑁 ∈ ℕ0)) → (𝑆 repeatS 𝑁) = ∅)
94, 7, 8sylancr 587 1 (𝑁 ∉ ℕ0 → (𝑆 repeatS 𝑁) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1540  wcel 2109  wnel 3030  Vcvv 3450  c0 4299  cmpt 5191   × cxp 5639  dom cdm 5641  (class class class)co 7390  0cc0 11075  0cn0 12449  ..^cfzo 13622   repeatS creps 14740
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972  df-reps 14741
This theorem is referenced by:  repswswrd  14756
  Copyright terms: Public domain W3C validator