Theorem ballotlemsval 34686

Description: Value of 𝑆. (Contributed by Thierry Arnoux, 12-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) − 𝑖), 𝑖)))

Assertion

Ref	Expression
ballotlemsval	⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑆‘𝐶) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝑖), 𝑖)))

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

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

Proof of Theorem ballotlemsval

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 482	. . . . . 6 ⊢ ((𝑑 = 𝐶 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → 𝑑 = 𝐶)
2	1	fveq2d 6846	. . . . 5 ⊢ ((𝑑 = 𝐶 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (𝐼‘𝑑) = (𝐼‘𝐶))
3	2	breq2d 5112	. . . 4 ⊢ ((𝑑 = 𝐶 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (𝑖 ≤ (𝐼‘𝑑) ↔ 𝑖 ≤ (𝐼‘𝐶)))
4	2	oveq1d 7383	. . . . 5 ⊢ ((𝑑 = 𝐶 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → ((𝐼‘𝑑) + 1) = ((𝐼‘𝐶) + 1))
5	4	oveq1d 7383	. . . 4 ⊢ ((𝑑 = 𝐶 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (((𝐼‘𝑑) + 1) − 𝑖) = (((𝐼‘𝐶) + 1) − 𝑖))
6	3, 5	ifbieq1d 4506	. . 3 ⊢ ((𝑑 = 𝐶 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → if(𝑖 ≤ (𝐼‘𝑑), (((𝐼‘𝑑) + 1) − 𝑖), 𝑖) = if(𝑖 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝑖), 𝑖))
7	6	mpteq2dva 5193	. 2 ⊢ (𝑑 = 𝐶 → (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑑), (((𝐼‘𝑑) + 1) − 𝑖), 𝑖)) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝑖), 𝑖)))
8		ballotth.s	. . 3 ⊢ 𝑆 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)))
9		simpl 482	. . . . . . . 8 ⊢ ((𝑐 = 𝑑 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → 𝑐 = 𝑑)
10	9	fveq2d 6846	. . . . . . 7 ⊢ ((𝑐 = 𝑑 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (𝐼‘𝑐) = (𝐼‘𝑑))
11	10	breq2d 5112	. . . . . 6 ⊢ ((𝑐 = 𝑑 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (𝑖 ≤ (𝐼‘𝑐) ↔ 𝑖 ≤ (𝐼‘𝑑)))
12	10	oveq1d 7383	. . . . . . 7 ⊢ ((𝑐 = 𝑑 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → ((𝐼‘𝑐) + 1) = ((𝐼‘𝑑) + 1))
13	12	oveq1d 7383	. . . . . 6 ⊢ ((𝑐 = 𝑑 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (((𝐼‘𝑐) + 1) − 𝑖) = (((𝐼‘𝑑) + 1) − 𝑖))
14	11, 13	ifbieq1d 4506	. . . . 5 ⊢ ((𝑐 = 𝑑 ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖) = if(𝑖 ≤ (𝐼‘𝑑), (((𝐼‘𝑑) + 1) − 𝑖), 𝑖))
15	14	mpteq2dva 5193	. . . 4 ⊢ (𝑐 = 𝑑 → (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑑), (((𝐼‘𝑑) + 1) − 𝑖), 𝑖)))
16	15	cbvmptv 5204	. . 3 ⊢ (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖))) = (𝑑 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑑), (((𝐼‘𝑑) + 1) − 𝑖), 𝑖)))
17	8, 16	eqtri 2760	. 2 ⊢ 𝑆 = (𝑑 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑑), (((𝐼‘𝑑) + 1) − 𝑖), 𝑖)))
18		ovex 7401	. . 3 ⊢ (1...(𝑀 + 𝑁)) ∈ V
19	18	mptex 7179	. 2 ⊢ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝑖), 𝑖)) ∈ V
20	7, 17, 19	fvmpt 6949	1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑆‘𝐶) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝐶), (((𝐼‘𝐶) + 1) − 𝑖), 𝑖)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  {crab 3401   ∖ cdif 3900   ∩ cin 3902  ifcif 4481  𝒫 cpw 4556   class class class wbr 5100   ↦ cmpt 5181  ‘cfv 6500  (class class class)co 7368  infcinf 9356  ℝcr 11037  0cc0 11038  1c1 11039   + caddc 11041   < clt 11178   ≤ cle 11179   − cmin 11376   / cdiv 11806  ℕcn 12157  ℤcz 12500  ...cfz 13435  ♯chash 14265

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371

This theorem is referenced by:  ballotlemsv  34687  ballotlemsf1o  34691  ballotlemieq  34694