ballotlemro - Mathbox for Thierry Arnoux

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

Theorem ballotlemro 30584

Description: Range of 𝑅 is included in 𝑂. (Contributed by Thierry Arnoux, 17-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	⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))

**Assertion**
Ref	Expression
ballotlemro	⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) ∈ 𝑂)

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

**Proof of Theorem ballotlemro**
Step	Hyp	Ref	Expression
1		ballotth.m	. . . 4 ⊢ 𝑀 ∈ ℕ
2		ballotth.n	. . . 4 ⊢ 𝑁 ∈ ℕ
3		ballotth.o	. . . 4 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (#‘𝑐) = 𝑀}
4		ballotth.p	. . . 4 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((#‘𝑥) / (#‘𝑂)))
5		ballotth.f	. . . 4 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((#‘((1...𝑖) ∩ 𝑐)) − (#‘((1...𝑖) ∖ 𝑐)))))
6		ballotth.e	. . . 4 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
7		ballotth.mgtn	. . . 4 ⊢ 𝑁 < 𝑀
8		ballotth.i	. . . 4 ⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
9		ballotth.s	. . . 4 ⊢ 𝑆 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼‘𝑐), (((𝐼‘𝑐) + 1) − 𝑖), 𝑖)))
10		ballotth.r	. . . 4 ⊢ 𝑅 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ ((𝑆‘𝑐) “ 𝑐))
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	ballotlemrval 30579	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) = ((𝑆‘𝐶) “ 𝐶))
12		imassrn 5477	. . . 4 ⊢ ((𝑆‘𝐶) “ 𝐶) ⊆ ran (𝑆‘𝐶)
13	1, 2, 3, 4, 5, 6, 7, 8, 9	ballotlemsf1o 30575	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)) ∧ ^◡(𝑆‘𝐶) = (𝑆‘𝐶)))
14	13	simpld 475	. . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)))
15		f1ofo 6144	. . . . 5 ⊢ ((𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)) → (𝑆‘𝐶):(1...(𝑀 + 𝑁))–onto→(1...(𝑀 + 𝑁)))
16		forn 6118	. . . . 5 ⊢ ((𝑆‘𝐶):(1...(𝑀 + 𝑁))–onto→(1...(𝑀 + 𝑁)) → ran (𝑆‘𝐶) = (1...(𝑀 + 𝑁)))
17	14, 15, 16	3syl 18	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ran (𝑆‘𝐶) = (1...(𝑀 + 𝑁)))
18	12, 17	syl5sseq 3653	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑆‘𝐶) “ 𝐶) ⊆ (1...(𝑀 + 𝑁)))
19	11, 18	eqsstrd 3639	. 2 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) ⊆ (1...(𝑀 + 𝑁)))
20		f1of1 6136	. . . . . . 7 ⊢ ((𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1-onto→(1...(𝑀 + 𝑁)) → (𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1→(1...(𝑀 + 𝑁)))
21	14, 20	syl 17	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1→(1...(𝑀 + 𝑁)))
22		eldifi 3732	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 𝐶 ∈ 𝑂)
23	1, 2, 3	ballotlemelo 30549	. . . . . . . 8 ⊢ (𝐶 ∈ 𝑂 ↔ (𝐶 ⊆ (1...(𝑀 + 𝑁)) ∧ (#‘𝐶) = 𝑀))
24	22, 23	sylib 208	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐶 ⊆ (1...(𝑀 + 𝑁)) ∧ (#‘𝐶) = 𝑀))
25	24	simpld 475	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 𝐶 ⊆ (1...(𝑀 + 𝑁)))
26		id 22	. . . . . 6 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 𝐶 ∈ (𝑂 ∖ 𝐸))
27		f1imaeng 8016	. . . . . 6 ⊢ (((𝑆‘𝐶):(1...(𝑀 + 𝑁))–1-1→(1...(𝑀 + 𝑁)) ∧ 𝐶 ⊆ (1...(𝑀 + 𝑁)) ∧ 𝐶 ∈ (𝑂 ∖ 𝐸)) → ((𝑆‘𝐶) “ 𝐶) ≈ 𝐶)
28	21, 25, 26, 27	syl3anc 1326	. . . . 5 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝑆‘𝐶) “ 𝐶) ≈ 𝐶)
29	11, 28	eqbrtrd 4675	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) ≈ 𝐶)
30		hasheni 13136	. . . 4 ⊢ ((𝑅‘𝐶) ≈ 𝐶 → (#‘(𝑅‘𝐶)) = (#‘𝐶))
31	29, 30	syl 17	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (#‘(𝑅‘𝐶)) = (#‘𝐶))
32	24	simprd 479	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (#‘𝐶) = 𝑀)
33	31, 32	eqtrd 2656	. 2 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (#‘(𝑅‘𝐶)) = 𝑀)
34	1, 2, 3	ballotlemelo 30549	. 2 ⊢ ((𝑅‘𝐶) ∈ 𝑂 ↔ ((𝑅‘𝐶) ⊆ (1...(𝑀 + 𝑁)) ∧ (#‘(𝑅‘𝐶)) = 𝑀))
35	19, 33, 34	sylanbrc 698	1 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝑅‘𝐶) ∈ 𝑂)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 {crab 2916 ∖ cdif 3571 ∩ cin 3573 ⊆ wss 3574 ifcif 4086 𝒫 cpw 4158 class class class wbr 4653 ↦ cmpt 4729 ^◡ccnv 5113 ran crn 5115 “ cima 5117 –1-1→wf1 5885 –onto→wfo 5886 –1-1-onto→wf1o 5887 ‘cfv 5888 (class class class)co 6650 ≈ cen 7952 infcinf 8347 ℝcr 9935 0cc0 9936 1c1 9937 + caddc 9939 < clt 10074 ≤ cle 10075 − cmin 10266 / cdiv 10684 ℕcn 11020 ℤcz 11377 ...cfz 12326 #chash 13117

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-fz 12327 df-hash 13118

This theorem is referenced by: ballotlemfrc 30588 ballotlemfrceq 30590 ballotlemfrcn0 30591 ballotlemrc 30592

W3C validator