Theorem ballotlemoex 35118

Description: 𝑂 is a set. (Contributed by Thierry Arnoux, 7-Dec-2016.)

Hypotheses

Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotth.o	⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}

Assertion

Ref	Expression
ballotlemoex	⊢ 𝑂 ∈ V

Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐

Proof of Theorem ballotlemoex

Step	Hyp	Ref	Expression
1		ballotth.o	. 2 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
2		ovex 7453	. . 3 ⊢ (1...(𝑀 + 𝑁)) ∈ V
3	2	pwex 5342	. 2 ⊢ 𝒫 (1...(𝑀 + 𝑁)) ∈ V
4	1, 3	rabex2 5302	1 ⊢ 𝑂 ∈ V

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451  𝒫 cpw 4557  ‘cfv 6538  (class class class)co 7420  1c1 11201   + caddc 11203  ℕcn 12335  ...cfz 13639  ♯chash 14474

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-pw 4559  df-sn 4585  df-pr 4587  df-uni 4868  df-iota 6494  df-fv 6546  df-ov 7423

This theorem is used by:  ballotlem2  35121  ballotlem8  35169