Theorem ballotlemrval 31777

Description: Value of 𝑅. (Contributed by Thierry Arnoux, 14-Apr-2017.)

Hypotheses

Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotth.o	⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
ballotth.p	⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotth.e	⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
ballotth.mgtn	⊢ 𝑁 < 𝑀
ballotth.i	⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
ballotth.s	⊢ 𝑆 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)))
ballotth.r	⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))

Assertion

Ref	Expression
ballotlemrval	⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) = ((𝑆‘𝐶) “ 𝐶))

Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂   𝑘,𝑀   𝑘,𝑁   𝑘,𝑂   𝑖,𝑐,𝐹,𝑘   𝐶,𝑖,𝑘   𝑖,𝐸,𝑘   𝐶,𝑘   𝑘,𝐼,𝑐   𝐸,𝑐   𝑖,𝐼,𝑐   𝑆,𝑘,𝑖,𝑐

Allowed substitution hints:   𝐶(𝑥,𝑐)   𝑃(𝑥,𝑖,𝑘,𝑐)   𝑅(𝑥,𝑖,𝑘,𝑐)   𝑆(𝑥)   𝐸(𝑥)   𝐹(𝑥)   𝐼(𝑥)   𝑀(𝑥)   𝑁(𝑥)   𝑂(𝑥)

Proof of Theorem ballotlemrval

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6672	. . 3 ⊢ (𝑑 = 𝐶 → (𝑆‘𝑑) = (𝑆‘𝐶))
2		id 22	. . 3 ⊢ (𝑑 = 𝐶 → 𝑑 = 𝐶)
3	1, 2	imaeq12d 5932	. 2 ⊢ (𝑑 = 𝐶 → ((𝑆‘𝑑) “ 𝑑) = ((𝑆‘𝐶) “ 𝐶))
4		ballotth.r	. . 3 ⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))
5		fveq2 6672	. . . . 5 ⊢ (𝑐 = 𝑑 → (𝑆‘𝑐) = (𝑆‘𝑑))
6		id 22	. . . . 5 ⊢ (𝑐 = 𝑑 → 𝑐 = 𝑑)
7	5, 6	imaeq12d 5932	. . . 4 ⊢ (𝑐 = 𝑑 → ((𝑆‘𝑐) “ 𝑐) = ((𝑆‘𝑑) “ 𝑑))
8	7	cbvmptv 5171	. . 3 ⊢ (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐)) = (𝑑 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑑) “ 𝑑))
9	4, 8	eqtri 2846	. 2 ⊢ 𝑅 = (𝑑 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑑) “ 𝑑))
10		fvex 6685	. . 3 ⊢ (𝑆‘𝐶) ∈ V
11		imaexg 7622	. . 3 ⊢ ((𝑆‘𝐶) ∈ V → ((𝑆‘𝐶) “ 𝐶) ∈ V)
12	10, 11	ax-mp 5	. 2 ⊢ ((𝑆‘𝐶) “ 𝐶) ∈ V
13	3, 9, 12	fvmpt 6770	1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) = ((𝑆‘𝐶) “ 𝐶))

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2114  ∀wral 3140  {crab 3144  Vcvv 3496   ∖ cdif 3935   ∩ cin 3937  ifcif 4469  𝒫 cpw 4541   class class class wbr 5068   ↦ cmpt 5148   “ cima 5560  ‘cfv 6357  (class class class)co 7158  infcinf 8907  ℝcr 10538  0cc0 10539  1c1 10540   + caddc 10542   < clt 10677   ≤ cle 10678   − cmin 10872   / cdiv 11299  ℕcn 11640  ℤcz 11984  ...cfz 12895  ♯chash 13693

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fv 6365

This theorem is referenced by:  ballotlemscr  31778  ballotlemrv  31779  ballotlemro  31782  ballotlemrinv0  31792