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

Theorem ballotlemieq 34498
Description: If two countings share the same first tie, they also have the same swap function. (Contributed by Thierry Arnoux, 18-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) − 𝑖), 𝑖)))
Assertion
Ref Expression
ballotlemieq ((𝐶 ∈ (𝑂𝐸) ∧ 𝐷 ∈ (𝑂𝐸) ∧ (𝐼𝐶) = (𝐼𝐷)) → (𝑆𝐶) = (𝑆𝐷))
Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂   𝑘,𝑀   𝑘,𝑁   𝑘,𝑂   𝑖,𝑐,𝐹,𝑘   𝐶,𝑖,𝑘   𝑖,𝐸,𝑘   𝐶,𝑘   𝑘,𝐼,𝑐   𝐸,𝑐   𝑖,𝐼,𝑐   𝑆,𝑘   𝐷,𝑖,𝑘
Allowed substitution hints:   𝐶(𝑥,𝑐)   𝐷(𝑥,𝑐)   𝑃(𝑥,𝑖,𝑘,𝑐)   𝑆(𝑥,𝑖,𝑐)   𝐸(𝑥)   𝐹(𝑥)   𝐼(𝑥)   𝑀(𝑥)   𝑁(𝑥)   𝑂(𝑥)

Proof of Theorem ballotlemieq
StepHypRef Expression
1 simpl 482 . . . . . 6 (((𝐼𝐶) = (𝐼𝐷) ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (𝐼𝐶) = (𝐼𝐷))
21breq2d 5160 . . . . 5 (((𝐼𝐶) = (𝐼𝐷) ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (𝑖 ≤ (𝐼𝐶) ↔ 𝑖 ≤ (𝐼𝐷)))
31oveq1d 7446 . . . . . 6 (((𝐼𝐶) = (𝐼𝐷) ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → ((𝐼𝐶) + 1) = ((𝐼𝐷) + 1))
43oveq1d 7446 . . . . 5 (((𝐼𝐶) = (𝐼𝐷) ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → (((𝐼𝐶) + 1) − 𝑖) = (((𝐼𝐷) + 1) − 𝑖))
52, 4ifbieq1d 4555 . . . 4 (((𝐼𝐶) = (𝐼𝐷) ∧ 𝑖 ∈ (1...(𝑀 + 𝑁))) → if(𝑖 ≤ (𝐼𝐶), (((𝐼𝐶) + 1) − 𝑖), 𝑖) = if(𝑖 ≤ (𝐼𝐷), (((𝐼𝐷) + 1) − 𝑖), 𝑖))
65mpteq2dva 5248 . . 3 ((𝐼𝐶) = (𝐼𝐷) → (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐶), (((𝐼𝐶) + 1) − 𝑖), 𝑖)) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐷), (((𝐼𝐷) + 1) − 𝑖), 𝑖)))
763ad2ant3 1134 . 2 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐷 ∈ (𝑂𝐸) ∧ (𝐼𝐶) = (𝐼𝐷)) → (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐶), (((𝐼𝐶) + 1) − 𝑖), 𝑖)) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐷), (((𝐼𝐷) + 1) − 𝑖), 𝑖)))
8 ballotth.m . . . 4 𝑀 ∈ ℕ
9 ballotth.n . . . 4 𝑁 ∈ ℕ
10 ballotth.o . . . 4 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
11 ballotth.p . . . 4 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
12 ballotth.f . . . 4 𝐹 = (𝑐𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
13 ballotth.e . . . 4 𝐸 = {𝑐𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹𝑐)‘𝑖)}
14 ballotth.mgtn . . . 4 𝑁 < 𝑀
15 ballotth.i . . . 4 𝐼 = (𝑐 ∈ (𝑂𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹𝑐)‘𝑘) = 0}, ℝ, < ))
16 ballotth.s . . . 4 𝑆 = (𝑐 ∈ (𝑂𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝑐), (((𝐼𝑐) + 1) − 𝑖), 𝑖)))
178, 9, 10, 11, 12, 13, 14, 15, 16ballotlemsval 34490 . . 3 (𝐶 ∈ (𝑂𝐸) → (𝑆𝐶) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐶), (((𝐼𝐶) + 1) − 𝑖), 𝑖)))
18173ad2ant1 1132 . 2 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐷 ∈ (𝑂𝐸) ∧ (𝐼𝐶) = (𝐼𝐷)) → (𝑆𝐶) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐶), (((𝐼𝐶) + 1) − 𝑖), 𝑖)))
198, 9, 10, 11, 12, 13, 14, 15, 16ballotlemsval 34490 . . 3 (𝐷 ∈ (𝑂𝐸) → (𝑆𝐷) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐷), (((𝐼𝐷) + 1) − 𝑖), 𝑖)))
20193ad2ant2 1133 . 2 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐷 ∈ (𝑂𝐸) ∧ (𝐼𝐶) = (𝐼𝐷)) → (𝑆𝐷) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝐷), (((𝐼𝐷) + 1) − 𝑖), 𝑖)))
217, 18, 203eqtr4d 2785 1 ((𝐶 ∈ (𝑂𝐸) ∧ 𝐷 ∈ (𝑂𝐸) ∧ (𝐼𝐶) = (𝐼𝐷)) → (𝑆𝐶) = (𝑆𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  wral 3059  {crab 3433  cdif 3960  cin 3962  ifcif 4531  𝒫 cpw 4605   class class class wbr 5148  cmpt 5231  cfv 6563  (class class class)co 7431  infcinf 9479  cr 11152  0cc0 11153  1c1 11154   + caddc 11156   < clt 11293  cle 11294  cmin 11490   / cdiv 11918  cn 12264  cz 12611  ...cfz 13544  chash 14366
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434
This theorem is referenced by:  ballotlemrinv0  34514
  Copyright terms: Public domain W3C validator