Theorem reps 14841

Description: Construct a function mapping a half-open range of nonnegative integers to a constant. (Contributed by AV, 4-Nov-2018.)

Assertion

Ref	Expression
reps	⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑆 repeatS 𝑁) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))

Distinct variable groups:   𝑥,𝑁   𝑥,𝑆

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem reps

Dummy variables 𝑛 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3471	. . 3 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
2	1	adantr 486	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → 𝑆 ∈ V)
3		simpr 490	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0)
4		ovex 7446	. . 3 ⊢ (0..^𝑁) ∈ V
5		mptexg 7220	. . 3 ⊢ ((0..^𝑁) ∈ V → (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V)
6	4, 5	mp1i 14	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V)
7		oveq2 7421	. . . . 5 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = (0..^𝑁))
8	7	adantl 487	. . . 4 ⊢ ((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) → (0..^𝑛) = (0..^𝑁))
9		simpll 779	. . . 4 ⊢ (((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) ∧ 𝑥 ∈ (0..^𝑛)) → 𝑠 = 𝑆)
10	8, 9	mpteq12dva 5191	. . 3 ⊢ ((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) → (𝑥 ∈ (0..^𝑛) ↦ 𝑠) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))
11		df-reps 14840	. . 3 ⊢ repeatS = (𝑠 ∈ V, 𝑛 ∈ ℕ0 ↦ (𝑥 ∈ (0..^𝑛) ↦ 𝑠))
12	10, 11	ovmpoga 7567	. 2 ⊢ ((𝑆 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V) → (𝑆 repeatS 𝑁) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))
13	2, 3, 6, 12	syl3anc 1398	1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑆 repeatS 𝑁) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ↦ cmpt 5186  (class class class)co 7413  0cc0 11124  ℕ₀cn0 12528  ..^cfzo 13709   repeatS creps 14839

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-reps 14840

This theorem is used by:  repsconst  14843  repsf  14844  repswsymb  14845  repswswrd  14855  repswccat  14857  repswrevw  14858  repsco  14911