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 34915

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 4239	. . . . . 6 ⊢ ((𝑉 ∪ 𝑊) ∩ 𝑈) = ((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈))
2	1	fveq2i 6884	. . . . 5 ⊢ (♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) = (♯‘((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈)))
3		ballotlemgun.2	. . . . . . 7 ⊢ (𝜑 → 𝑉 ∈ Fin)
4		infi 9226	. . . . . . 7 ⊢ (𝑉 ∈ Fin → (𝑉 ∩ 𝑈) ∈ Fin)
5	3, 4	syl 18	. . . . . 6 ⊢ (𝜑 → (𝑉 ∩ 𝑈) ∈ Fin)
6		ballotlemgun.3	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ Fin)
7		infi 9226	. . . . . . 7 ⊢ (𝑊 ∈ Fin → (𝑊 ∩ 𝑈) ∈ Fin)
8	6, 7	syl 18	. . . . . 6 ⊢ (𝜑 → (𝑊 ∩ 𝑈) ∈ Fin)
9		ballotlemgun.4	. . . . . . . 8 ⊢ (𝜑 → (𝑉 ∩ 𝑊) = ∅)
10	9	ineq1d 4172	. . . . . . 7 ⊢ (𝜑 → ((𝑉 ∩ 𝑊) ∩ 𝑈) = (∅ ∩ 𝑈))
11		inindir 4188	. . . . . . 7 ⊢ ((𝑉 ∩ 𝑊) ∩ 𝑈) = ((𝑉 ∩ 𝑈) ∩ (𝑊 ∩ 𝑈))
12		0in 4354	. . . . . . 7 ⊢ (∅ ∩ 𝑈) = ∅
13	10, 11, 12	3eqtr3g 2821	. . . . . 6 ⊢ (𝜑 → ((𝑉 ∩ 𝑈) ∩ (𝑊 ∩ 𝑈)) = ∅)
14		hashun 14414	. . . . . 6 ⊢ (((𝑉 ∩ 𝑈) ∈ Fin ∧ (𝑊 ∩ 𝑈) ∈ Fin ∧ ((𝑉 ∩ 𝑈) ∩ (𝑊 ∩ 𝑈)) = ∅) → (♯‘((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈))) = ((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))))
15	5, 8, 13, 14	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (♯‘((𝑉 ∩ 𝑈) ∪ (𝑊 ∩ 𝑈))) = ((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))))
16	2, 15	eqtrid 2810	. . . 4 ⊢ (𝜑 → (♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) = ((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))))
17		difundir 4244	. . . . . 6 ⊢ ((𝑉 ∪ 𝑊) ∖ 𝑈) = ((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈))
18	17	fveq2i 6884	. . . . 5 ⊢ (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈)) = (♯‘((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈)))
19		diffi 9155	. . . . . . 7 ⊢ (𝑉 ∈ Fin → (𝑉 ∖ 𝑈) ∈ Fin)
20	3, 19	syl 18	. . . . . 6 ⊢ (𝜑 → (𝑉 ∖ 𝑈) ∈ Fin)
21		diffi 9155	. . . . . . 7 ⊢ (𝑊 ∈ Fin → (𝑊 ∖ 𝑈) ∈ Fin)
22	6, 21	syl 18	. . . . . 6 ⊢ (𝜑 → (𝑊 ∖ 𝑈) ∈ Fin)
23	9	difeq1d 4080	. . . . . . 7 ⊢ (𝜑 → ((𝑉 ∩ 𝑊) ∖ 𝑈) = (∅ ∖ 𝑈))
24		difindir 4246	. . . . . . 7 ⊢ ((𝑉 ∩ 𝑊) ∖ 𝑈) = ((𝑉 ∖ 𝑈) ∩ (𝑊 ∖ 𝑈))
25		0dif 4363	. . . . . . 7 ⊢ (∅ ∖ 𝑈) = ∅
26	23, 24, 25	3eqtr3g 2821	. . . . . 6 ⊢ (𝜑 → ((𝑉 ∖ 𝑈) ∩ (𝑊 ∖ 𝑈)) = ∅)
27		hashun 14414	. . . . . 6 ⊢ (((𝑉 ∖ 𝑈) ∈ Fin ∧ (𝑊 ∖ 𝑈) ∈ Fin ∧ ((𝑉 ∖ 𝑈) ∩ (𝑊 ∖ 𝑈)) = ∅) → (♯‘((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈))) = ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈))))
28	20, 22, 26, 27	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (♯‘((𝑉 ∖ 𝑈) ∪ (𝑊 ∖ 𝑈))) = ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈))))
29	18, 28	eqtrid 2810	. . . 4 ⊢ (𝜑 → (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈)) = ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈))))
30	16, 29	oveq12d 7428	. . 3 ⊢ (𝜑 → ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))) = (((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))) − ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈)))))
31		hashcl 14388	. . . . . 6 ⊢ ((𝑉 ∩ 𝑈) ∈ Fin → (♯‘(𝑉 ∩ 𝑈)) ∈ ℕ₀)
32	3, 4, 31	3syl 19	. . . . 5 ⊢ (𝜑 → (♯‘(𝑉 ∩ 𝑈)) ∈ ℕ₀)
33	32	nn0cnd 12562	. . . 4 ⊢ (𝜑 → (♯‘(𝑉 ∩ 𝑈)) ∈ ℂ)
34		hashcl 14388	. . . . . 6 ⊢ ((𝑊 ∩ 𝑈) ∈ Fin → (♯‘(𝑊 ∩ 𝑈)) ∈ ℕ₀)
35	6, 7, 34	3syl 19	. . . . 5 ⊢ (𝜑 → (♯‘(𝑊 ∩ 𝑈)) ∈ ℕ₀)
36	35	nn0cnd 12562	. . . 4 ⊢ (𝜑 → (♯‘(𝑊 ∩ 𝑈)) ∈ ℂ)
37		hashcl 14388	. . . . . 6 ⊢ ((𝑉 ∖ 𝑈) ∈ Fin → (♯‘(𝑉 ∖ 𝑈)) ∈ ℕ₀)
38	3, 19, 37	3syl 19	. . . . 5 ⊢ (𝜑 → (♯‘(𝑉 ∖ 𝑈)) ∈ ℕ₀)
39	38	nn0cnd 12562	. . . 4 ⊢ (𝜑 → (♯‘(𝑉 ∖ 𝑈)) ∈ ℂ)
40		hashcl 14388	. . . . . 6 ⊢ ((𝑊 ∖ 𝑈) ∈ Fin → (♯‘(𝑊 ∖ 𝑈)) ∈ ℕ₀)
41	6, 21, 40	3syl 19	. . . . 5 ⊢ (𝜑 → (♯‘(𝑊 ∖ 𝑈)) ∈ ℕ₀)
42	41	nn0cnd 12562	. . . 4 ⊢ (𝜑 → (♯‘(𝑊 ∖ 𝑈)) ∈ ℂ)
43	33, 36, 39, 42	addsub4d 11611	. . 3 ⊢ (𝜑 → (((♯‘(𝑉 ∩ 𝑈)) + (♯‘(𝑊 ∩ 𝑈))) − ((♯‘(𝑉 ∖ 𝑈)) + (♯‘(𝑊 ∖ 𝑈)))) = (((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))) + ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈)))))
44	30, 43	eqtrd 2798	. 2 ⊢ (𝜑 → ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))) = (((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))) + ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈)))))
45		ballotlemgun.1	. . 3 ⊢ (𝜑 → 𝑈 ∈ Fin)
46		unfi 9151	. . . 4 ⊢ ((𝑉 ∈ Fin ∧ 𝑊 ∈ Fin) → (𝑉 ∪ 𝑊) ∈ Fin)
47	3, 6, 46	syl2anc 595	. . 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 34914	. . 3 ⊢ ((𝑈 ∈ Fin ∧ (𝑉 ∪ 𝑊) ∈ Fin) → (𝑈 ↑ (𝑉 ∪ 𝑊)) = ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))))
60	45, 47, 59	syl2anc 595	. 2 ⊢ (𝜑 → (𝑈 ↑ (𝑉 ∪ 𝑊)) = ((♯‘((𝑉 ∪ 𝑊) ∩ 𝑈)) − (♯‘((𝑉 ∪ 𝑊) ∖ 𝑈))))
61	48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58	ballotlemgval 34914	. . . 4 ⊢ ((𝑈 ∈ Fin ∧ 𝑉 ∈ Fin) → (𝑈 ↑ 𝑉) = ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))))
62	45, 3, 61	syl2anc 595	. . 3 ⊢ (𝜑 → (𝑈 ↑ 𝑉) = ((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))))
63	48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58	ballotlemgval 34914	. . . 4 ⊢ ((𝑈 ∈ Fin ∧ 𝑊 ∈ Fin) → (𝑈 ↑ 𝑊) = ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈))))
64	45, 6, 63	syl2anc 595	. . 3 ⊢ (𝜑 → (𝑈 ↑ 𝑊) = ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈))))
65	62, 64	oveq12d 7428	. 2 ⊢ (𝜑 → ((𝑈 ↑ 𝑉) + (𝑈 ↑ 𝑊)) = (((♯‘(𝑉 ∩ 𝑈)) − (♯‘(𝑉 ∖ 𝑈))) + ((♯‘(𝑊 ∩ 𝑈)) − (♯‘(𝑊 ∖ 𝑈)))))
66	44, 60, 65	3eqtr4d 2808	1 ⊢ (𝜑 → (𝑈 ↑ (𝑉 ∪ 𝑊)) = ((𝑈 ↑ 𝑉) + (𝑈 ↑ 𝑊)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 ∀wral 3079 {crab 3416 ∖ cdif 3902 ∪ cun 3903 ∩ cin 3904 ∅c0 4286 ifcif 4487 𝒫 cpw 4562 class class class wbr 5109 ↦ cmpt 5192 “ cima 5664 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 Fincfn 8939 infcinf 9397 ℝcr 11094 0cc0 11095 1c1 11096 + caddc 11098 < clt 11238 ≤ cle 11239 − cmin 11436 / cdiv 11866 ℕcn 12228 ℕ₀cn0 12499 ℤcz 12586 ...cfz 13530 ♯chash 14362

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-oadd 8453 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-dju 9883 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-hash 14363

This theorem is referenced by: ballotlemfrceq 34919

W3C validator