ballotlemgun - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ballotlemgun		Structured version Visualization version GIF version

Theorem ballotlemgun 34416

Description: A property of the defined ↑ operator. (Contributed by Thierry Arnoux, 26-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 ↦ ((♯‘(𝑣 ∩ 𝑢)) − (♯‘(𝑣 ∖ 𝑢))))
ballotlemgun.1	⊢ (𝜑 → 𝑈 ∈ Fin)
ballotlemgun.2	⊢ (𝜑 → 𝑉 ∈ Fin)
ballotlemgun.3	⊢ (𝜑 → 𝑊 ∈ Fin)
ballotlemgun.4	⊢ (𝜑 → (𝑉 ∩ 𝑊) = ∅)

**Assertion**
Ref	Expression
ballotlemgun	⊢ (𝜑 → (𝑈 ↑ (𝑉 ∪ 𝑊)) = ((𝑈 ↑ 𝑉) + (𝑈 ↑ 𝑊)))

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

**Proof of Theorem ballotlemgun**
Step	Hyp	Ref	Expression
1		indir 4287	. . . . . 6 ⊢ ((𝑉 ∪ 𝑊) ∩ 𝑈) = ((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈))
2	1	fveq2i 6908	. . . . 5 ⊢ (♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) = (♯‘((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈)))
3		ballotlemgun.2	. . . . . . 7 ⊢ (𝜑 → 𝑉 ∈ Fin)
4		infi 9309	. . . . . . 7 ⊢ (𝑉 ∈ Fin → (𝑉 ∩ 𝑈) ∈ Fin)
5	3, 4	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑉 ∩ 𝑈) ∈ Fin)
6		ballotlemgun.3	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ Fin)
7		infi 9309	. . . . . . 7 ⊢ (𝑊 ∈ Fin → (𝑊 ∩ 𝑈) ∈ Fin)
8	6, 7	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑊 ∩ 𝑈) ∈ Fin)
9		ballotlemgun.4	. . . . . . . 8 ⊢ (𝜑 → (𝑉 ∩ 𝑊) = ∅)
10	9	ineq1d 4222	. . . . . . 7 ⊢ (𝜑 → ((𝑉 ∩ 𝑊) ∩ 𝑈) = (∅ ∩ 𝑈))
11		inindir 4239	. . . . . . 7 ⊢ ((𝑉 ∩ 𝑊) ∩ 𝑈) = ((𝑉 ∩ 𝑈) ∩ (𝑊 ∩ 𝑈))
12		0in 4404	. . . . . . 7 ⊢ (∅ ∩ 𝑈) = ∅
13	10, 11, 12	3eqtr3g 2792	. . . . . 6 ⊢ (𝜑 → ((𝑉 ∩ 𝑈) ∩ (𝑊 ∩ 𝑈)) = ∅)
14		hashun 14411	. . . . . 6 ⊢ (((𝑉 ∩ 𝑈) ∈ Fin ∧ (𝑊 ∩ 𝑈) ∈ Fin ∧ ((𝑉 ∩ 𝑈) ∩ (𝑊 ∩ 𝑈)) = ∅) → (♯‘((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈))) = ((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))))
15	5, 8, 13, 14	syl3anc 1368	. . . . 5 ⊢ (𝜑 → (♯‘((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈))) = ((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))))
16	2, 15	eqtrid 2781	. . . 4 ⊢ (𝜑 → (♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) = ((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))))
17		difundir 4292	. . . . . 6 ⊢ ((𝑉 ∪ 𝑊) ∖ 𝑈) = ((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈))
18	17	fveq2i 6908	. . . . 5 ⊢ (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈)) = (♯‘((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈)))
19		diffi 9221	. . . . . . 7 ⊢ (𝑉 ∈ Fin → (𝑉 ∖ 𝑈) ∈ Fin)
20	3, 19	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑉 ∖ 𝑈) ∈ Fin)
21		diffi 9221	. . . . . . 7 ⊢ (𝑊 ∈ Fin → (𝑊 ∖ 𝑈) ∈ Fin)
22	6, 21	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑊 ∖ 𝑈) ∈ Fin)
23	9	difeq1d 4130	. . . . . . 7 ⊢ (𝜑 → ((𝑉 ∩ 𝑊) ∖ 𝑈) = (∅ ∖ 𝑈))
24		difindir 4294	. . . . . . 7 ⊢ ((𝑉 ∩ 𝑊) ∖ 𝑈) = ((𝑉 ∖ 𝑈) ∩ (𝑊 ∖ 𝑈))
25		0dif 4412	. . . . . . 7 ⊢ (∅ ∖ 𝑈) = ∅
26	23, 24, 25	3eqtr3g 2792	. . . . . 6 ⊢ (𝜑 → ((𝑉 ∖ 𝑈) ∩ (𝑊 ∖ 𝑈)) = ∅)
27		hashun 14411	. . . . . 6 ⊢ (((𝑉 ∖ 𝑈) ∈ Fin ∧ (𝑊 ∖ 𝑈) ∈ Fin ∧ ((𝑉 ∖ 𝑈) ∩ (𝑊 ∖ 𝑈)) = ∅) → (♯‘((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈))) = ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈))))
28	20, 22, 26, 27	syl3anc 1368	. . . . 5 ⊢ (𝜑 → (♯‘((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈))) = ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈))))
29	18, 28	eqtrid 2781	. . . 4 ⊢ (𝜑 → (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈)) = ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈))))
30	16, 29	oveq12d 7448	. . 3 ⊢ (𝜑 → ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))) = (((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))) − ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈)))))
31		hashcl 14385	. . . . . 6 ⊢ ((𝑉 ∩ 𝑈) ∈ Fin → (♯‘(𝑉 ∩ 𝑈)) ∈ ℕ₀)
32	3, 4, 31	3syl 18	. . . . 5 ⊢ (𝜑 → (♯‘(𝑉 ∩ 𝑈)) ∈ ℕ₀)
33	32	nn0cnd 12596	. . . 4 ⊢ (𝜑 → (♯‘(𝑉 ∩ 𝑈)) ∈ ℂ)
34		hashcl 14385	. . . . . 6 ⊢ ((𝑊 ∩ 𝑈) ∈ Fin → (♯‘(𝑊 ∩ 𝑈)) ∈ ℕ₀)
35	6, 7, 34	3syl 18	. . . . 5 ⊢ (𝜑 → (♯‘(𝑊 ∩ 𝑈)) ∈ ℕ₀)
36	35	nn0cnd 12596	. . . 4 ⊢ (𝜑 → (♯‘(𝑊 ∩ 𝑈)) ∈ ℂ)
37		hashcl 14385	. . . . . 6 ⊢ ((𝑉 ∖ 𝑈) ∈ Fin → (♯‘(𝑉 ∖ 𝑈)) ∈ ℕ₀)
38	3, 19, 37	3syl 18	. . . . 5 ⊢ (𝜑 → (♯‘(𝑉 ∖ 𝑈)) ∈ ℕ₀)
39	38	nn0cnd 12596	. . . 4 ⊢ (𝜑 → (♯‘(𝑉 ∖ 𝑈)) ∈ ℂ)
40		hashcl 14385	. . . . . 6 ⊢ ((𝑊 ∖ 𝑈) ∈ Fin → (♯‘(𝑊 ∖ 𝑈)) ∈ ℕ₀)
41	6, 21, 40	3syl 18	. . . . 5 ⊢ (𝜑 → (♯‘(𝑊 ∖ 𝑈)) ∈ ℕ₀)
42	41	nn0cnd 12596	. . . 4 ⊢ (𝜑 → (♯‘(𝑊 ∖ 𝑈)) ∈ ℂ)
43	33, 36, 39, 42	addsub4d 11675	. . 3 ⊢ (𝜑 → (((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))) − ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈)))) = (((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))) + ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈)))))
44	30, 43	eqtrd 2769	. 2 ⊢ (𝜑 → ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))) = (((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))) + ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈)))))
45		ballotlemgun.1	. . 3 ⊢ (𝜑 → 𝑈 ∈ Fin)
46		unfi 9217	. . . 4 ⊢ ((𝑉 ∈ Fin ∧ 𝑊 ∈ Fin) → (𝑉 ∪ 𝑊) ∈ Fin)
47	3, 6, 46	syl2anc 582	. . 3 ⊢ (𝜑 → (𝑉 ∪ 𝑊) ∈ Fin)
48		ballotth.m	. . . 4 ⊢ 𝑀 ∈ ℕ
49		ballotth.n	. . . 4 ⊢ 𝑁 ∈ ℕ
50		ballotth.o	. . . 4 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
51		ballotth.p	. . . 4 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
52		ballotth.f	. . . 4 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
53		ballotth.e	. . . 4 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
54		ballotth.mgtn	. . . 4 ⊢ 𝑁 < 𝑀
55		ballotth.i	. . . 4 ⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
56		ballotth.s	. . . 4 ⊢ 𝑆 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)))
57		ballotth.r	. . . 4 ⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))
58		ballotlemg	. . . 4 ⊢ ↑ = (𝑢 ∈ Fin, 𝑣 ∈ Fin ↦ ((♯‘(𝑣 ∩ 𝑢)) − (♯‘(𝑣 ∖ 𝑢))))
59	48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58	ballotlemgval 34415	. . 3 ⊢ ((𝑈 ∈ Fin ∧ (𝑉 ∪ 𝑊) ∈ Fin) → (𝑈 ↑ (𝑉 ∪ 𝑊)) = ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))))
60	45, 47, 59	syl2anc 582	. 2 ⊢ (𝜑 → (𝑈 ↑ (𝑉 ∪ 𝑊)) = ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))))
61	48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58	ballotlemgval 34415	. . . 4 ⊢ ((𝑈 ∈ Fin ∧ 𝑉 ∈ Fin) → (𝑈 ↑ 𝑉) = ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))))
62	45, 3, 61	syl2anc 582	. . 3 ⊢ (𝜑 → (𝑈 ↑ 𝑉) = ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))))
63	48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58	ballotlemgval 34415	. . . 4 ⊢ ((𝑈 ∈ Fin ∧ 𝑊 ∈ Fin) → (𝑈 ↑ 𝑊) = ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈))))
64	45, 6, 63	syl2anc 582	. . 3 ⊢ (𝜑 → (𝑈 ↑ 𝑊) = ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈))))
65	62, 64	oveq12d 7448	. 2 ⊢ (𝜑 → ((𝑈 ↑ 𝑉) + (𝑈 ↑ 𝑊)) = (((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))) + ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈)))))
66	44, 60, 65	3eqtr4d 2779	1 ⊢ (𝜑 → (𝑈 ↑ (𝑉 ∪ 𝑊)) = ((𝑈 ↑ 𝑉) + (𝑈 ↑ 𝑊)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1534 ∈ wcel 2100 ∀wral 3054 {crab 3428 ∖ cdif 3956 ∪ cun 3957 ∩ cin 3958 ∅c0 4335 ifcif 4536 𝒫 cpw 4610 class class class wbr 5156 ↦ cmpt 5239 “ cima 5689 ‘cfv 6558 (class class class)co 7430 ∈ cmpo 7432 Fincfn 8982 infcinf 9491 ℝcr 11164 0cc0 11165 1c1 11166 + caddc 11168 < clt 11305 ≤ cle 11306 − cmin 11501 / cdiv 11928 ℕcn 12274 ℕ₀cn0 12534 ℤcz 12620 ...cfz 13548 ♯chash 14359

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2102 ax-9 2110 ax-10 2133 ax-11 2150 ax-12 2170 ax-ext 2700 ax-sep 5307 ax-nul 5314 ax-pow 5373 ax-pr 5437 ax-un 7751 ax-cnex 11221 ax-resscn 11222 ax-1cn 11223 ax-icn 11224 ax-addcl 11225 ax-addrcl 11226 ax-mulcl 11227 ax-mulrcl 11228 ax-mulcom 11229 ax-addass 11230 ax-mulass 11231 ax-distr 11232 ax-i2m1 11233 ax-1ne0 11234 ax-1rid 11235 ax-rnegex 11236 ax-rrecex 11237 ax-cnre 11238 ax-pre-lttri 11239 ax-pre-lttrn 11240 ax-pre-ltadd 11241 ax-pre-mulgt0 11242

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2062 df-mo 2532 df-eu 2561 df-clab 2707 df-cleq 2721 df-clel 2806 df-nfc 2881 df-ne 2934 df-nel 3040 df-ral 3055 df-rex 3064 df-reu 3374 df-rab 3429 df-v 3474 df-sbc 3789 df-csb 3905 df-dif 3962 df-un 3964 df-in 3966 df-ss 3976 df-pss 3979 df-nul 4336 df-if 4537 df-pw 4612 df-sn 4637 df-pr 4639 df-op 4643 df-uni 4919 df-int 4960 df-iun 5008 df-br 5157 df-opab 5219 df-mpt 5240 df-tr 5274 df-id 5584 df-eprel 5590 df-po 5598 df-so 5599 df-fr 5641 df-we 5643 df-xp 5692 df-rel 5693 df-cnv 5694 df-co 5695 df-dm 5696 df-rn 5697 df-res 5698 df-ima 5699 df-pred 6317 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6510 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7386 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7885 df-1st 8011 df-2nd 8012 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-1o 8504 df-oadd 8508 df-er 8742 df-en 8983 df-dom 8984 df-sdom 8985 df-fin 8986 df-dju 9951 df-card 9989 df-pnf 11307 df-mnf 11308 df-xr 11309 df-ltxr 11310 df-le 11311 df-sub 11503 df-neg 11504 df-nn 12275 df-n0 12535 df-z 12621 df-uz 12885 df-hash 14360

This theorem is referenced by: ballotlemfrceq 34420

W3C validator