Theorem ballotfileme 13180

Description: Elements of 𝐸. (Contributed by Thierry Arnoux, 14-Dec-2016.)

Hypotheses

Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotfilem.o	⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
ballotfilem.p	⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotth.e	⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}

Assertion

Ref	Expression
ballotfileme	⊢ (𝐶 ∈ 𝐸 ↔ (𝐶 ∈ 𝑂 ∧ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))

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

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

Proof of Theorem ballotfileme

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 5675	. . . . 5 ⊢ (𝑑 = 𝐶 → (𝐹‘𝑑) = (𝐹‘𝐶))
2	1	fveq1d 5677	. . . 4 ⊢ (𝑑 = 𝐶 → ((𝐹‘𝑑)‘𝑖) = ((𝐹‘𝐶)‘𝑖))
3	2	breq2d 4126	. . 3 ⊢ (𝑑 = 𝐶 → (0 < ((𝐹‘𝑑)‘𝑖) ↔ 0 < ((𝐹‘𝐶)‘𝑖)))
4	3	ralbidv 2544	. 2 ⊢ (𝑑 = 𝐶 → (∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑑)‘𝑖) ↔ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))
5		ballotth.e	. . 3 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
6		fveq2 5675	. . . . . . 7 ⊢ (𝑐 = 𝑑 → (𝐹‘𝑐) = (𝐹‘𝑑))
7	6	fveq1d 5677	. . . . . 6 ⊢ (𝑐 = 𝑑 → ((𝐹‘𝑐)‘𝑖) = ((𝐹‘𝑑)‘𝑖))
8	7	breq2d 4126	. . . . 5 ⊢ (𝑐 = 𝑑 → (0 < ((𝐹‘𝑐)‘𝑖) ↔ 0 < ((𝐹‘𝑑)‘𝑖)))
9	8	ralbidv 2544	. . . 4 ⊢ (𝑐 = 𝑑 → (∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖) ↔ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑑)‘𝑖)))
10	9	cbvrabv 2814	. . 3 ⊢ {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)} = {𝑑 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑑)‘𝑖)}
11	5, 10	eqtri 2255	. 2 ⊢ 𝐸 = {𝑑 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑑)‘𝑖)}
12	4, 11	elrab2 2979	1 ⊢ (𝐶 ∈ 𝐸 ↔ (𝐶 ∈ 𝑂 ∧ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝐶)‘𝑖)))

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1398   ∈ wcel 2205  ∀wral 2522  {crab 2526   ∖ cdif 3211   ∩ cin 3213  𝒫 cpw 3674   class class class wbr 4114   ↦ cmpt 4176  ‘cfv 5357  (class class class)co 6058  Fincfn 6988  0cc0 8143  1c1 8144   + caddc 8146   < clt 8324   − cmin 8460   / cdiv 8963  ℕcn 9254  ℤcz 9594  ...cfz 10361  ♯chash 11163

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-un 3218  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-iota 5317  df-fv 5365

This theorem is referenced by:  ballotfilemodife  13184  ballotfilem4  13185