Theorem ballotlemfval 35009

Description: The value of 𝐹. (Contributed by Thierry Arnoux, 23-Nov-2016.)

Hypotheses

Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotth.o	⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
ballotth.p	⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotlemfval.c	⊢ (𝜑 → 𝐶 ∈ 𝑂)
ballotlemfval.j	⊢ (𝜑 → 𝐽 ∈ ℤ)

Assertion

Ref	Expression
ballotlemfval	⊢ (𝜑 → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))

Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂,𝑐   𝐹,𝑐,𝑖   𝐶,𝑖   𝑖,𝐽   𝜑,𝑖

Allowed substitution hints:   𝜑(𝑥, 𝑐)   𝐶(𝑥, 𝑐)   𝑃(𝑥, 𝑖, 𝑐)   𝐹(𝑥)   𝐽(𝑥, 𝑐)   𝑀(𝑥)   𝑁(𝑥)   𝑂(𝑥)

Proof of Theorem ballotlemfval

Dummy variable 𝑏 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ballotlemfval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑂)
2		simpl 488	. . . . . . . 8 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → 𝑏 = 𝐶)
3	2	ineq2d 4169	. . . . . . 7 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → ((1...𝑖) ∩ 𝑏) = ((1...𝑖) ∩ 𝐶))
4	3	fveq2d 6886	. . . . . 6 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → (♯‘((1...𝑖) ∩ 𝑏)) = (♯‘((1...𝑖) ∩ 𝐶)))
5	2	difeq2d 4077	. . . . . . 7 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → ((1...𝑖) ∖ 𝑏) = ((1...𝑖) ∖ 𝐶))
6	5	fveq2d 6886	. . . . . 6 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → (♯‘((1...𝑖) ∖ 𝑏)) = (♯‘((1...𝑖) ∖ 𝐶)))
7	4, 6	oveq12d 7435	. . . . 5 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏))) = ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶))))
8	7	mpteq2dva 5202	. . . 4 ⊢ (𝑏 = 𝐶 → (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏)))) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))))
9		ballotth.f	. . . . 5 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
10		ineq2 4163	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → ((1...𝑖) ∩ 𝑏) = ((1...𝑖) ∩ 𝑐))
11	10	fveq2d 6886	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → (♯‘((1...𝑖) ∩ 𝑏)) = (♯‘((1...𝑖) ∩ 𝑐)))
12		difeq2 4071	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → ((1...𝑖) ∖ 𝑏) = ((1...𝑖) ∖ 𝑐))
13	12	fveq2d 6886	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → (♯‘((1...𝑖) ∖ 𝑏)) = (♯‘((1...𝑖) ∖ 𝑐)))
14	11, 13	oveq12d 7435	. . . . . . 7 ⊢ (𝑏 = 𝑐 → ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏))) = ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐))))
15	14	mpteq2dv 5203	. . . . . 6 ⊢ (𝑏 = 𝑐 → (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏)))) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
16	15	cbvmptv 5213	. . . . 5 ⊢ (𝑏 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏))))) = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
17	9, 16	eqtr4i 2788	. . . 4 ⊢ 𝐹 = (𝑏 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏)))))
18		zex 12628	. . . . 5 ⊢ ℤ ∈ V
19	18	mptex 7226	. . . 4 ⊢ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))) ∈ V
20	8, 17, 19	fvmpt 6990	. . 3 ⊢ (𝐶 ∈ 𝑂 → (𝐹‘𝐶) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))))
21	1, 20	syl 18	. 2 ⊢ (𝜑 → (𝐹‘𝐶) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))))
22		oveq2 7425	. . . . . 6 ⊢ (𝑖 = 𝐽 → (1...𝑖) = (1...𝐽))
23	22	ineq1d 4168	. . . . 5 ⊢ (𝑖 = 𝐽 → ((1...𝑖) ∩ 𝐶) = ((1...𝐽) ∩ 𝐶))
24	23	fveq2d 6886	. . . 4 ⊢ (𝑖 = 𝐽 → (♯‘((1...𝑖) ∩ 𝐶)) = (♯‘((1...𝐽) ∩ 𝐶)))
25	22	difeq1d 4076	. . . . 5 ⊢ (𝑖 = 𝐽 → ((1...𝑖) ∖ 𝐶) = ((1...𝐽) ∖ 𝐶))
26	25	fveq2d 6886	. . . 4 ⊢ (𝑖 = 𝐽 → (♯‘((1...𝑖) ∖ 𝐶)) = (♯‘((1...𝐽) ∖ 𝐶)))
27	24, 26	oveq12d 7435	. . 3 ⊢ (𝑖 = 𝐽 → ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶))) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
28	27	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝑖 = 𝐽) → ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶))) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
29		ballotlemfval.j	. 2 ⊢ (𝜑 → 𝐽 ∈ ℤ)
30		ovexd 7452	. 2 ⊢ (𝜑 → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) ∈ V)
31	21, 28, 29, 30	fvmptd 6998	1 ⊢ (𝜑 → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3414  Vcvv 3453   ∖ cdif 3899   ∩ cin 3901  𝒫 cpw 4560   ↦ cmpt 5190  ‘cfv 6537  (class class class)co 7417  1c1 11129   + caddc 11131   − cmin 11469   / cdiv 11899  ℕcn 12261  ℤcz 12619  ...cfz 13565  ♯chash 14398

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-cnex 11184  ax-resscn 11185

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-neg 11472  df-z 12620

This theorem is used by:  ballotlemfelz  35010  ballotlemfp1  35011  ballotlemfmpn  35014  ballotlemfval0  35015  ballotlemfg  35045  ballotlemfrc  35046