Theorem reps 14961

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 3475	. . 3 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
2	1	adantr 486	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → 𝑆 ∈ V)
3		simpr 490	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0)
4		ovex 7482	. . 3 ⊢ (0..^𝑁) ∈ V
5		mptexg 7256	. . 3 ⊢ ((0..^𝑁) ∈ V → (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V)
6	4, 5	mp1i 14	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V)
7		oveq2 7457	. . . . 5 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = (0..^𝑁))
8	7	adantl 487	. . . 4 ⊢ ((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) → (0..^𝑛) = (0..^𝑁))
9		simpll 779	. . . 4 ⊢ (((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) ∧ 𝑥 ∈ (0..^𝑛)) → 𝑠 = 𝑆)
10	8, 9	mpteq12dva 5195	. . 3 ⊢ ((𝑠 = 𝑆 ∧ 𝑛 = 𝑁) → (𝑥 ∈ (0..^𝑛) ↦ 𝑠) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))
11		df-reps 14960	. . 3 ⊢ repeatS = (𝑠 ∈ V, 𝑛 ∈ ℕ0 ↦ (𝑥 ∈ (0..^𝑛) ↦ 𝑠))
12	10, 11	ovmpoga 7604	. 2 ⊢ ((𝑆 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ (𝑥 ∈ (0..^𝑁) ↦ 𝑆) ∈ V) → (𝑆 repeatS 𝑁) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))
13	2, 3, 6, 12	syl3anc 1399	1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑆 repeatS 𝑁) = (𝑥 ∈ (0..^𝑁) ↦ 𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ↦ cmpt 5190  (class class class)co 7449  0cc0 11237  ℕ₀cn0 12644  ..^cfzo 13826   repeatS creps 14959

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-ov 7452  df-oprab 7453  df-mpo 7454  df-reps 14960

This theorem is used by:  repsconst  14963  repsf  14964  repswsymb  14965  repswswrd  14975  repswccat  14977  repswrevw  14978  repsco  15031