Theorem ballotlemgval 35149

Description: Expand the value of ↑. (Contributed by Thierry Arnoux, 21-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	⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))
ballotlemg	⊢ ↑ = (𝑢 ∈ Fin, 𝑣 ∈ Fin ↦ ((♯‘(𝑣 ∩ 𝑢)) − (♯‘(𝑣 ∖ 𝑢))))

Assertion

Ref	Expression
ballotlemgval	⊢ ((𝑈 ∈ Fin ∧ 𝑉 ∈ Fin) → (𝑈 ↑ 𝑉) = ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))))

Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂   𝑘,𝑀   𝑘,𝑁   𝑘,𝑂   𝑖,𝑐,𝐹,𝑘   𝑖,𝐸,𝑘   𝑘,𝐼,𝑐   𝐸,𝑐   𝑖,𝐼,𝑐   𝑆,𝑘,𝑖,𝑐   𝑅,𝑖   𝑣,𝑢,𝐼   𝑢,𝑅,𝑣   𝑢,𝑆,𝑣   𝑢,𝑈,𝑣   𝑢,𝑉,𝑣

Allowed substitution hints:   𝑃(𝑥, 𝑣, 𝑢, 𝑖, 𝑘, 𝑐)   𝑅(𝑥, 𝑘, 𝑐)   𝑆(𝑥)   𝑈(𝑥, 𝑖, 𝑘, 𝑐)   𝐸(𝑥, 𝑣, 𝑢)   ↑ (𝑥, 𝑣, 𝑢, 𝑖, 𝑘, 𝑐)   𝐹(𝑥, 𝑣, 𝑢)   𝐼(𝑥)   𝑀(𝑥, 𝑣, 𝑢)   𝑁(𝑥, 𝑣, 𝑢)   𝑂(𝑥, 𝑣, 𝑢)   𝑉(𝑥, 𝑖, 𝑘, 𝑐)

Proof of Theorem ballotlemgval

Step	Hyp	Ref	Expression
1		ineq2 4160	. . . 4 ⊢ (𝑢 = 𝑈 → (𝑣 ∩ 𝑢) = (𝑣 ∩ 𝑈))
2	1	fveq2d 6887	. . 3 ⊢ (𝑢 = 𝑈 → (♯‘(𝑣 ∩ 𝑢)) = (♯‘(𝑣 ∩ 𝑈)))
3		difeq2 4068	. . . 4 ⊢ (𝑢 = 𝑈 → (𝑣 ∖ 𝑢) = (𝑣 ∖ 𝑈))
4	3	fveq2d 6887	. . 3 ⊢ (𝑢 = 𝑈 → (♯‘(𝑣 ∖ 𝑢)) = (♯‘(𝑣 ∖ 𝑈)))
5	2, 4	oveq12d 7436	. 2 ⊢ (𝑢 = 𝑈 → ((♯‘(𝑣 ∩ 𝑢)) − (♯‘(𝑣 ∖ 𝑢))) = ((♯‘(𝑣 ∩ 𝑈)) − (♯‘(𝑣 ∖ 𝑈))))
6		ineq1 4159	. . . 4 ⊢ (𝑣 = 𝑉 → (𝑣 ∩ 𝑈) = (𝑉 ∩ 𝑈))
7	6	fveq2d 6887	. . 3 ⊢ (𝑣 = 𝑉 → (♯‘(𝑣 ∩ 𝑈)) = (♯‘(𝑉 ∩ 𝑈)))
8		difeq1 4067	. . . 4 ⊢ (𝑣 = 𝑉 → (𝑣 ∖ 𝑈) = (𝑉 ∖ 𝑈))
9	8	fveq2d 6887	. . 3 ⊢ (𝑣 = 𝑉 → (♯‘(𝑣 ∖ 𝑈)) = (♯‘(𝑉 ∖ 𝑈)))
10	7, 9	oveq12d 7436	. 2 ⊢ (𝑣 = 𝑉 → ((♯‘(𝑣 ∩ 𝑈)) − (♯‘(𝑣 ∖ 𝑈))) = ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))))
11		ballotlemg	. 2 ⊢ ↑ = (𝑢 ∈ Fin, 𝑣 ∈ Fin ↦ ((♯‘(𝑣 ∩ 𝑢)) − (♯‘(𝑣 ∖ 𝑢))))
12		ovex 7451	. 2 ⊢ ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))) ∈ V
13	5, 10, 11, 12	ovmpo 7578	1 ⊢ ((𝑈 ∈ Fin ∧ 𝑉 ∈ Fin) → (𝑈 ↑ 𝑉) = ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413   ∖ cdif 3896   ∩ cin 3898  ifcif 4482  𝒫 cpw 4557   class class class wbr 5103   ↦ cmpt 5186   “ cima 5654  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  Fincfn 8966  infcinf 9426  ℝcr 11192  0cc0 11193  1c1 11194   + caddc 11196   < clt 11336   ≤ cle 11337   − cmin 11534   / cdiv 11966  ℕcn 12328  ℤcz 12686  ...cfz 13632  ♯chash 14467

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423

This theorem is used by:  ballotlemgun  35150  ballotlemfg  35151  ballotlemfrc  35152