ballotfilemfp1 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > ballotfilemfp1		GIF version

Theorem ballotfilemfp1 13231

Description: If the 𝐽 th ballot is for A, (𝐹‘𝐶) goes up 1. If the 𝐽 th ballot is for B, (𝐹‘𝐶) goes down 1. (Contributed by Thierry Arnoux, 24-Nov-2016.)

**Hypotheses**
Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotfilem.o	⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
ballotfilem.p	⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotlemfp1.c	⊢ (𝜑 → 𝐶 ∈ 𝑂)
ballotlemfp1.j	⊢ (𝜑 → 𝐽 ∈ ℕ)

**Assertion**
Ref	Expression
ballotfilemfp1	⊢ (𝜑 → ((¬ 𝐽 ∈ 𝐶 → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) − 1)) ∧ (𝐽 ∈ 𝐶 → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) + 1))))

Distinct variable groups: 𝑀,𝑐 𝑁,𝑐 𝑂,𝑐 𝑖,𝑀 𝑖,𝑁 𝑖,𝑂,𝑐 𝐹,𝑐,𝑖 𝐶,𝑖 𝑖,𝐽 𝜑,𝑖 Allowed substitution hints: 𝜑(𝑥, 𝑐) 𝐶(𝑥, 𝑐) 𝑃(𝑥, 𝑖, 𝑐) 𝐹(𝑥) 𝐽(𝑥, 𝑐) 𝑀(𝑥) 𝑁(𝑥) 𝑂(𝑥)

**Proof of Theorem ballotfilemfp1**
Step	Hyp	Ref	Expression
1		ballotth.m	. . . . . 6 ⊢ 𝑀 ∈ ℕ
2		ballotth.n	. . . . . 6 ⊢ 𝑁 ∈ ℕ
3		ballotfilem.o	. . . . . 6 ⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
4		ballotfilem.p	. . . . . 6 ⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
5		ballotth.f	. . . . . 6 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6		ballotlemfp1.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑂)
7		ballotlemfp1.j	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℕ)
8	7	nnzd 9767	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ ℤ)
9	1, 2, 3, 4, 5, 6, 8	ballotfilemfval 13229	. . . . 5 ⊢ (𝜑 → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
10	9	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
11		peano2zm 9682	. . . . . . . . . . 11 ⊢ (𝐽 ∈ ℤ → (𝐽 − 1) ∈ ℤ)
12	8, 11	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → (𝐽 − 1) ∈ ℤ)
13	1, 2, 3, 6, 12	ballotfilemcinfi 13224	. . . . . . . . 9 ⊢ (𝜑 → ((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin)
14		hashcl 11220	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℕ₀)
15	13, 14	syl 14	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℕ₀)
16	15	nn0cnd 9622	. . . . . . 7 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℂ)
17	16	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℂ)
18	1, 2, 3, 6, 12	ballotfilemdifcfi 13225	. . . . . . . . 9 ⊢ (𝜑 → ((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin)
19		hashcl 11220	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℕ₀)
20	18, 19	syl 14	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℕ₀)
21	20	nn0cnd 9622	. . . . . . 7 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℂ)
22	21	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℂ)
23		1cnd 8342	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → 1 ∈ ℂ)
24	17, 22, 23	subsub4d 8668	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) − 1) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1)))
25		1zzd 9671	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℤ)
26	8, 25	zsubcld 9773	. . . . . . . 8 ⊢ (𝜑 → (𝐽 − 1) ∈ ℤ)
27	1, 2, 3, 4, 5, 6, 26	ballotfilemfval 13229	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐶)‘(𝐽 − 1)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
28	27	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐽 − 1)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
29	28	oveq1d 6100	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((𝐹‘𝐶)‘(𝐽 − 1)) − 1) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) − 1))
30		elnnuz 9959	. . . . . . . . . . 11 ⊢ (𝐽 ∈ ℕ ↔ 𝐽 ∈ (ℤ_≥‘1))
31	7, 30	sylib 122	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ (ℤ_≥‘1))
32		fzspl 10476	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (ℤ_≥‘1) → (1...𝐽) = ((1...(𝐽 − 1)) ∪ {𝐽}))
33	32	ineq1d 3431	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∪ {𝐽}) ∩ 𝐶))
34		indir 3480	. . . . . . . . . . 11 ⊢ (((1...(𝐽 − 1)) ∪ {𝐽}) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))
35	33, 34	eqtrdi 2287	. . . . . . . . . 10 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)))
36	31, 35	syl 14	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)))
37	36	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)))
38		disjsn 3771	. . . . . . . . . . . 12 ⊢ ((𝐶 ∩ {𝐽}) = ∅ ↔ ¬ 𝐽 ∈ 𝐶)
39		ineqcom 3422	. . . . . . . . . . . 12 ⊢ ((𝐶 ∩ {𝐽}) = ∅ ↔ ({𝐽} ∩ 𝐶) = ∅)
40	38, 39	sylbb1 137	. . . . . . . . . . 11 ⊢ (¬ 𝐽 ∈ 𝐶 → ({𝐽} ∩ 𝐶) = ∅)
41	40	adantl 277	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ({𝐽} ∩ 𝐶) = ∅)
42	41	uneq2d 3383	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ∅))
43		un0 3556	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ∅) = ((1...(𝐽 − 1)) ∩ 𝐶)
44	42, 43	eqtrdi 2287	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)) = ((1...(𝐽 − 1)) ∩ 𝐶))
45	37, 44	eqtrd 2271	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...𝐽) ∩ 𝐶) = ((1...(𝐽 − 1)) ∩ 𝐶))
46	45	fveq2d 5699	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∩ 𝐶)) = (♯‘((1...(𝐽 − 1)) ∩ 𝐶)))
47	32	difeq1d 3346	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∪ {𝐽}) ∖ 𝐶))
48		difundir 3484	. . . . . . . . . . 11 ⊢ (((1...(𝐽 − 1)) ∪ {𝐽}) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))
49	47, 48	eqtrdi 2287	. . . . . . . . . 10 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)))
50	31, 49	syl 14	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)))
51		disj3 3577	. . . . . . . . . . . 12 ⊢ (({𝐽} ∩ 𝐶) = ∅ ↔ {𝐽} = ({𝐽} ∖ 𝐶))
52	40, 51	sylib 122	. . . . . . . . . . 11 ⊢ (¬ 𝐽 ∈ 𝐶 → {𝐽} = ({𝐽} ∖ 𝐶))
53	52	eqcomd 2244	. . . . . . . . . 10 ⊢ (¬ 𝐽 ∈ 𝐶 → ({𝐽} ∖ 𝐶) = {𝐽})
54	53	uneq2d 3383	. . . . . . . . 9 ⊢ (¬ 𝐽 ∈ 𝐶 → (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽}))
55	50, 54	sylan9eq 2291	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽}))
56	55	fveq2d 5699	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽})))
57	8	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → 𝐽 ∈ ℤ)
58	18	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin)
59		uzid 9936	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ ℤ → 𝐽 ∈ (ℤ_≥‘𝐽))
60		uznfz 10510	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (ℤ_≥‘𝐽) → ¬ 𝐽 ∈ (1...(𝐽 − 1)))
61	8, 59, 60	3syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝐽 ∈ (1...(𝐽 − 1)))
62	61	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ¬ 𝐽 ∈ (1...(𝐽 − 1)))
63		eldifi 3351	. . . . . . . . . 10 ⊢ (𝐽 ∈ ((1...(𝐽 − 1)) ∖ 𝐶) → 𝐽 ∈ (1...(𝐽 − 1)))
64	62, 63	nsyl 637	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∖ 𝐶))
65	58, 64	jca 306	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin ∧ ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∖ 𝐶)))
66		hashunsng 11248	. . . . . . . 8 ⊢ (𝐽 ∈ ℤ → ((((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin ∧ ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∖ 𝐶)) → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽})) = ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1)))
67	57, 65, 66	sylc 62	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽})) = ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1))
68	56, 67	eqtrd 2271	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1))
69	46, 68	oveq12d 6103	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1)))
70	24, 29, 69	3eqtr4rd 2282	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = (((𝐹‘𝐶)‘(𝐽 − 1)) − 1))
71	10, 70	eqtrd 2271	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) − 1))
72	71	ex 115	. 2 ⊢ (𝜑 → (¬ 𝐽 ∈ 𝐶 → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) − 1)))
73	9	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
74	16	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℂ)
75		1cnd 8342	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → 1 ∈ ℂ)
76	21	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℂ)
77	74, 75, 76	addsubd 8658	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) + 1))
78	36	fveq2d 5699	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...𝐽) ∩ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))))
79	78	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∩ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))))
80		snssi 3859	. . . . . . . . . . 11 ⊢ (𝐽 ∈ 𝐶 → {𝐽} ⊆ 𝐶)
81		dfss2 3237	. . . . . . . . . . 11 ⊢ ({𝐽} ⊆ 𝐶 ↔ ({𝐽} ∩ 𝐶) = {𝐽})
82	80, 81	sylib 122	. . . . . . . . . 10 ⊢ (𝐽 ∈ 𝐶 → ({𝐽} ∩ 𝐶) = {𝐽})
83	82	uneq2d 3383	. . . . . . . . 9 ⊢ (𝐽 ∈ 𝐶 → (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ {𝐽}))
84	83	fveq2d 5699	. . . . . . . 8 ⊢ (𝐽 ∈ 𝐶 → (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))) = (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ {𝐽})))
85	84	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))) = (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ {𝐽})))
86		simpr 110	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → 𝐽 ∈ 𝐶)
87	13	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin)
88	8	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → 𝐽 ∈ ℤ)
89	88, 59, 60	3syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ¬ 𝐽 ∈ (1...(𝐽 − 1)))
90		elinel1 3415	. . . . . . . . . 10 ⊢ (𝐽 ∈ ((1...(𝐽 − 1)) ∩ 𝐶) → 𝐽 ∈ (1...(𝐽 − 1)))
91	89, 90	nsyl 637	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∩ 𝐶))
92	87, 91	jca 306	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin ∧ ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∩ 𝐶)))
93		hashunsng 11248	. . . . . . . 8 ⊢ (𝐽 ∈ 𝐶 → ((((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin ∧ ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∩ 𝐶)) → (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ {𝐽})) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1)))
94	86, 92, 93	sylc 62	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ {𝐽})) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1))
95	79, 85, 94	3eqtrd 2275	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∩ 𝐶)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1))
96	50	fveq2d 5699	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))))
97	96	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))))
98		ssdif0im 3589	. . . . . . . . . . 11 ⊢ ({𝐽} ⊆ 𝐶 → ({𝐽} ∖ 𝐶) = ∅)
99	80, 98	syl 14	. . . . . . . . . 10 ⊢ (𝐽 ∈ 𝐶 → ({𝐽} ∖ 𝐶) = ∅)
100	99	uneq2d 3383	. . . . . . . . 9 ⊢ (𝐽 ∈ 𝐶 → (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅))
101	100	fveq2d 5699	. . . . . . . 8 ⊢ (𝐽 ∈ 𝐶 → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅)))
102	101	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅)))
103		un0 3556	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅) = ((1...(𝐽 − 1)) ∖ 𝐶)
104	103	a1i 9	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅) = ((1...(𝐽 − 1)) ∖ 𝐶))
105	104	fveq2d 5699	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅)) = (♯‘((1...(𝐽 − 1)) ∖ 𝐶)))
106	97, 102, 105	3eqtrd 2275	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘((1...(𝐽 − 1)) ∖ 𝐶)))
107	95, 106	oveq12d 6103	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
108	27	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐽 − 1)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
109	108	oveq1d 6100	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((𝐹‘𝐶)‘(𝐽 − 1)) + 1) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) + 1))
110	77, 107, 109	3eqtr4d 2281	. . . 4 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = (((𝐹‘𝐶)‘(𝐽 − 1)) + 1))
111	73, 110	eqtrd 2271	. . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) + 1))
112	111	ex 115	. 2 ⊢ (𝜑 → (𝐽 ∈ 𝐶 → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) + 1)))
113	72, 112	jca 306	1 ⊢ (𝜑 → ((¬ 𝐽 ∈ 𝐶 → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) − 1)) ∧ (𝐽 ∈ 𝐶 → ((𝐹‘𝐶)‘𝐽) = (((𝐹‘𝐶)‘(𝐽 − 1)) + 1))))

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 {crab 2532 ∖ cdif 3217 ∪ cun 3218 ∩ cin 3219 ⊆ wss 3220 ∅c0 3520 𝒫 cpw 3688 {csn 3709 ↦ cmpt 4192 ‘cfv 5377 (class class class)co 6085 Fincfn 7022 ℂcc 8177 1c1 8180 + caddc 8182 − cmin 8497 / cdiv 9002 ℕcn 9304 ℕ₀cn0 9563 ℤcz 9644 ℤ_≥cuz 9921 ...cfz 10411 ♯chash 11214

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9305 df-n0 9564 df-z 9645 df-uz 9922 df-fz 10412 df-ihash 11215

This theorem is used by: ballotfilemfc0 13232 ballotfilemfcc 13233 ballotfilem4 13241 ballotfilemi1 13245 ballotfilemii 13246 ballotfilemic 13250 ballotfilem1c 13251

W3C validator