Theorem reps 14827

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 3478	. . 3 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
2	1	adantr 486	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → 𝑆 ∈ V)
3		simpr 490	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0)
4		ovex 7449	. . 3 ⊢ (0..^𝑁) ∈ V
5		mptexg 7223	. . 3 ⊢ ((0..^𝑁) ∈ V → (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V)
6	4, 5	mp1i 14	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V)
7		oveq2 7424	. . . . 5 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = (0..^𝑁))
8	7	adantl 487	. . . 4 ⊢ ((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) → (0..^𝑛) = (0..^𝑁))
9		simpll 779	. . . 4 ⊢ (((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) ∧ 𝑥 ∈ (0..^𝑛)) → 𝑠 = 𝑆)
10	8, 9	mpteq12dva 5199	. . 3 ⊢ ((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) → (𝑥 ∈ (0..^𝑛) ↦ 𝑠) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))
11		df-reps 14826	. . 3 ⊢ repeatS = (𝑠 ∈ V, 𝑛 ∈ ℕ0 ↦ (𝑥 ∈ (0..^𝑛) ↦ 𝑠))
12	10, 11	ovmpoga 7570	. 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 2146  Vcvv 3457   ↦ cmpt 5194  (class class class)co 7416  0cc0 11111  ℕ₀cn0 12515  ..^cfzo 13695   repeatS creps 14825

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-reps 14826

This theorem is used by:  repsconst  14829  repsf  14830  repswsymb  14831  repswswrd  14841  repswccat  14843  repswrevw  14844  repsco  14897