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

Theorem ballotlemrinv 31791
Description: 𝑅 is its own inverse : it is an involution. (Contributed by Thierry Arnoux, 10-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
ballotlemrinv 𝑅 = 𝑅
Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂   𝑘,𝑀   𝑘,𝑁   𝑘,𝑂   𝑖,𝑐,𝐹,𝑘   𝑖,𝐸,𝑘   𝑘,𝐼,𝑐   𝐸,𝑐   𝑖,𝐼,𝑐   𝑆,𝑘,𝑖,𝑐   𝑅,𝑖,𝑘   𝑥,𝑐,𝐹   𝑥,𝑀   𝑥,𝑁,𝑖,𝑘
Allowed substitution hints:   𝑃(𝑥,𝑖,𝑘,𝑐)   𝑅(𝑥,𝑐)   𝑆(𝑥)   𝐸(𝑥)   𝐼(𝑥)   𝑂(𝑥)

Proof of Theorem ballotlemrinv
Dummy variable 𝑑 is distinct from all other variables.
StepHypRef Expression
1 ballotth.m . . . . . . . 8 𝑀 ∈ ℕ
2 ballotth.n . . . . . . . 8 𝑁 ∈ ℕ
3 ballotth.o . . . . . . . 8 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
4 ballotth.p . . . . . . . 8 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
5 ballotth.f . . . . . . . 8 𝐹 = (𝑐𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6 ballotth.e . . . . . . . 8 𝐸 = {𝑐𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹𝑐)‘𝑖)}
7 ballotth.mgtn . . . . . . . 8 𝑁 < 𝑀
8 ballotth.i . . . . . . . 8 𝐼 = (𝑐 ∈ (𝑂𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹𝑐)‘𝑘) = 0}, ℝ, < ))
9 ballotth.s . . . . . . . 8 𝑆 = (𝑐 ∈ (𝑂𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ (𝐼𝑐), (((𝐼𝑐) + 1) − 𝑖), 𝑖)))
10 ballotth.r . . . . . . . 8 𝑅 = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
111, 2, 3, 4, 5, 6, 7, 8, 9, 10ballotlemrinv0 31790 . . . . . . 7 ((𝑐 ∈ (𝑂𝐸) ∧ 𝑑 = ((𝑆𝑐) “ 𝑐)) → (𝑑 ∈ (𝑂𝐸) ∧ 𝑐 = ((𝑆𝑑) “ 𝑑)))
121, 2, 3, 4, 5, 6, 7, 8, 9, 10ballotlemrinv0 31790 . . . . . . 7 ((𝑑 ∈ (𝑂𝐸) ∧ 𝑐 = ((𝑆𝑑) “ 𝑑)) → (𝑐 ∈ (𝑂𝐸) ∧ 𝑑 = ((𝑆𝑐) “ 𝑐)))
1311, 12impbii 211 . . . . . 6 ((𝑐 ∈ (𝑂𝐸) ∧ 𝑑 = ((𝑆𝑐) “ 𝑐)) ↔ (𝑑 ∈ (𝑂𝐸) ∧ 𝑐 = ((𝑆𝑑) “ 𝑑)))
1413a1i 11 . . . . 5 (⊤ → ((𝑐 ∈ (𝑂𝐸) ∧ 𝑑 = ((𝑆𝑐) “ 𝑐)) ↔ (𝑑 ∈ (𝑂𝐸) ∧ 𝑐 = ((𝑆𝑑) “ 𝑑))))
1514mptcnv 5998 . . . 4 (⊤ → (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐)) = (𝑑 ∈ (𝑂𝐸) ↦ ((𝑆𝑑) “ 𝑑)))
1615mptru 1544 . . 3 (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐)) = (𝑑 ∈ (𝑂𝐸) ↦ ((𝑆𝑑) “ 𝑑))
17 fveq2 6670 . . . . 5 (𝑑 = 𝑐 → (𝑆𝑑) = (𝑆𝑐))
18 id 22 . . . . 5 (𝑑 = 𝑐𝑑 = 𝑐)
1917, 18imaeq12d 5930 . . . 4 (𝑑 = 𝑐 → ((𝑆𝑑) “ 𝑑) = ((𝑆𝑐) “ 𝑐))
2019cbvmptv 5169 . . 3 (𝑑 ∈ (𝑂𝐸) ↦ ((𝑆𝑑) “ 𝑑)) = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
2116, 20eqtri 2844 . 2 (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐)) = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
2210cnveqi 5745 . 2 𝑅 = (𝑐 ∈ (𝑂𝐸) ↦ ((𝑆𝑐) “ 𝑐))
2321, 22, 103eqtr4i 2854 1 𝑅 = 𝑅
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398   = wceq 1537  wtru 1538  wcel 2114  wral 3138  {crab 3142  cdif 3933  cin 3935  ifcif 4467  𝒫 cpw 4539   class class class wbr 5066  cmpt 5146  ccnv 5554  cima 5558  cfv 6355  (class class class)co 7156  infcinf 8905  cr 10536  0cc0 10537  1c1 10538   + caddc 10540   < clt 10675  cle 10676  cmin 10870   / cdiv 11297  cn 11638  cz 11982  ...cfz 12893  chash 13691
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-oadd 8106  df-er 8289  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-sup 8906  df-inf 8907  df-dju 9330  df-card 9368  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-nn 11639  df-2 11701  df-n0 11899  df-z 11983  df-uz 12245  df-rp 12391  df-fz 12894  df-hash 13692
This theorem is referenced by:  ballotlem7  31793
  Copyright terms: Public domain W3C validator