ballotfilemfp1 - Intuitionistic Logic Explorer

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

Theorem ballotfilemfp1 13152

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	⊢ 𝑁 ∈ ℕ
ballotfi.o	⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
ballotfi.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		ballotfi.o	. . . . . 6 ⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
4		ballotfi.p	. . . . . 6 ⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
5		ballotth.f	. . . . . 6 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6		ballotlemfp1.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑂)
7		ballotlemfp1.j	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℕ)
8	7	nnzd 9702	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ ℤ)
9	1, 2, 3, 4, 5, 6, 8	ballotfilemfval 13150	. . . . 5 ⊢ (𝜑 → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
10	9	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
11		peano2zm 9617	. . . . . . . . . . 11 ⊢ (𝐽 ∈ ℤ → (𝐽 − 1) ∈ ℤ)
12	8, 11	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → (𝐽 − 1) ∈ ℤ)
13	1, 2, 3, 6, 12	ballotfilemcinfi 13147	. . . . . . . . 9 ⊢ (𝜑 → ((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin)
14		hashcl 11148	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℕ₀)
15	13, 14	syl 14	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℕ₀)
16	15	nn0cnd 9557	. . . . . . 7 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℂ)
17	16	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...(𝐽 − 1)) ∩ 𝐶)) ∈ ℂ)
18	1, 2, 3, 6, 12	ballotfilemdifcfi 13148	. . . . . . . . 9 ⊢ (𝜑 → ((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin)
19		hashcl 11148	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℕ₀)
20	18, 19	syl 14	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℕ₀)
21	20	nn0cnd 9557	. . . . . . 7 ⊢ (𝜑 → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℂ)
22	21	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℂ)
23		1cnd 8292	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → 1 ∈ ℂ)
24	17, 22, 23	subsub4d 8617	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) − 1) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1)))
25		1zzd 9606	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℤ)
26	8, 25	zsubcld 9708	. . . . . . . 8 ⊢ (𝜑 → (𝐽 − 1) ∈ ℤ)
27	1, 2, 3, 4, 5, 6, 26	ballotfilemfval 13150	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐶)‘(𝐽 − 1)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
28	27	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐽 − 1)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
29	28	oveq1d 6067	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((𝐹‘𝐶)‘(𝐽 − 1)) − 1) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) − 1))
30		elnnuz 9894	. . . . . . . . . . 11 ⊢ (𝐽 ∈ ℕ ↔ 𝐽 ∈ (ℤ_≥‘1))
31	7, 30	sylib 122	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ (ℤ_≥‘1))
32		fzspl 10407	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (ℤ_≥‘1) → (1...𝐽) = ((1...(𝐽 − 1)) ∪ {𝐽}))
33	32	ineq1d 3423	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∪ {𝐽}) ∩ 𝐶))
34		indir 3472	. . . . . . . . . . 11 ⊢ (((1...(𝐽 − 1)) ∪ {𝐽}) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))
35	33, 34	eqtrdi 2283	. . . . . . . . . 10 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)))
36	31, 35	syl 14	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)))
37	36	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...𝐽) ∩ 𝐶) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)))
38		disjsn 3753	. . . . . . . . . . . 12 ⊢ ((𝐶 ∩ {𝐽}) = ∅ ↔ ¬ 𝐽 ∈ 𝐶)
39		ineqcom 3414	. . . . . . . . . . . 12 ⊢ ((𝐶 ∩ {𝐽}) = ∅ ↔ ({𝐽} ∩ 𝐶) = ∅)
40	38, 39	sylbb1 137	. . . . . . . . . . 11 ⊢ (¬ 𝐽 ∈ 𝐶 → ({𝐽} ∩ 𝐶) = ∅)
41	40	adantl 277	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ({𝐽} ∩ 𝐶) = ∅)
42	41	uneq2d 3375	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ∅))
43		un0 3544	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ∅) = ((1...(𝐽 − 1)) ∩ 𝐶)
44	42, 43	eqtrdi 2283	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)) = ((1...(𝐽 − 1)) ∩ 𝐶))
45	37, 44	eqtrd 2267	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...𝐽) ∩ 𝐶) = ((1...(𝐽 − 1)) ∩ 𝐶))
46	45	fveq2d 5676	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∩ 𝐶)) = (♯‘((1...(𝐽 − 1)) ∩ 𝐶)))
47	32	difeq1d 3338	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∪ {𝐽}) ∖ 𝐶))
48		difundir 3476	. . . . . . . . . . 11 ⊢ (((1...(𝐽 − 1)) ∪ {𝐽}) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))
49	47, 48	eqtrdi 2283	. . . . . . . . . 10 ⊢ (𝐽 ∈ (ℤ_≥‘1) → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)))
50	31, 49	syl 14	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)))
51		disj3 3563	. . . . . . . . . . . 12 ⊢ (({𝐽} ∩ 𝐶) = ∅ ↔ {𝐽} = ({𝐽} ∖ 𝐶))
52	40, 51	sylib 122	. . . . . . . . . . 11 ⊢ (¬ 𝐽 ∈ 𝐶 → {𝐽} = ({𝐽} ∖ 𝐶))
53	52	eqcomd 2240	. . . . . . . . . 10 ⊢ (¬ 𝐽 ∈ 𝐶 → ({𝐽} ∖ 𝐶) = {𝐽})
54	53	uneq2d 3375	. . . . . . . . 9 ⊢ (¬ 𝐽 ∈ 𝐶 → (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽}))
55	50, 54	sylan9eq 2287	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...𝐽) ∖ 𝐶) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽}))
56	55	fveq2d 5676	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ {𝐽})))
57	8	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → 𝐽 ∈ ℤ)
58	18	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin)
59		uzid 9871	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ ℤ → 𝐽 ∈ (ℤ_≥‘𝐽))
60		uznfz 10441	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (ℤ_≥‘𝐽) → ¬ 𝐽 ∈ (1...(𝐽 − 1)))
61	8, 59, 60	3syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝐽 ∈ (1...(𝐽 − 1)))
62	61	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ¬ 𝐽 ∈ (1...(𝐽 − 1)))
63		eldifi 3343	. . . . . . . . . 10 ⊢ (𝐽 ∈ ((1...(𝐽 − 1)) ∖ 𝐶) → 𝐽 ∈ (1...(𝐽 − 1)))
64	62, 63	nsyl 633	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∖ 𝐶))
65	58, 64	jca 306	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∖ 𝐶) ∈ Fin ∧ ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∖ 𝐶)))
66		hashunsng 11176	. . . . . . . 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 2267	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1))
69	46, 68	oveq12d 6070	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − ((♯‘((1...(𝐽 − 1)) ∖ 𝐶)) + 1)))
70	24, 29, 69	3eqtr4rd 2278	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = (((𝐹‘𝐶)‘(𝐽 − 1)) − 1))
71	10, 70	eqtrd 2267	. . 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 8292	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → 1 ∈ ℂ)
76	21	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...(𝐽 − 1)) ∖ 𝐶)) ∈ ℂ)
77	74, 75, 76	addsubd 8607	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) + 1))
78	36	fveq2d 5676	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...𝐽) ∩ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))))
79	78	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∩ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶))))
80		snssi 3840	. . . . . . . . . . 11 ⊢ (𝐽 ∈ 𝐶 → {𝐽} ⊆ 𝐶)
81		dfss2 3230	. . . . . . . . . . 11 ⊢ ({𝐽} ⊆ 𝐶 ↔ ({𝐽} ∩ 𝐶) = {𝐽})
82	80, 81	sylib 122	. . . . . . . . . 10 ⊢ (𝐽 ∈ 𝐶 → ({𝐽} ∩ 𝐶) = {𝐽})
83	82	uneq2d 3375	. . . . . . . . 9 ⊢ (𝐽 ∈ 𝐶 → (((1...(𝐽 − 1)) ∩ 𝐶) ∪ ({𝐽} ∩ 𝐶)) = (((1...(𝐽 − 1)) ∩ 𝐶) ∪ {𝐽}))
84	83	fveq2d 5676	. . . . . . . 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 3407	. . . . . . . . . 10 ⊢ (𝐽 ∈ ((1...(𝐽 − 1)) ∩ 𝐶) → 𝐽 ∈ (1...(𝐽 − 1)))
91	89, 90	nsyl 633	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∩ 𝐶))
92	87, 91	jca 306	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∩ 𝐶) ∈ Fin ∧ ¬ 𝐽 ∈ ((1...(𝐽 − 1)) ∩ 𝐶)))
93		hashunsng 11176	. . . . . . . 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 2271	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∩ 𝐶)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1))
96	50	fveq2d 5676	. . . . . . . 8 ⊢ (𝜑 → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))))
97	96	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))))
98		ssdif0im 3575	. . . . . . . . . . 11 ⊢ ({𝐽} ⊆ 𝐶 → ({𝐽} ∖ 𝐶) = ∅)
99	80, 98	syl 14	. . . . . . . . . 10 ⊢ (𝐽 ∈ 𝐶 → ({𝐽} ∖ 𝐶) = ∅)
100	99	uneq2d 3375	. . . . . . . . 9 ⊢ (𝐽 ∈ 𝐶 → (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶)) = (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅))
101	100	fveq2d 5676	. . . . . . . 8 ⊢ (𝐽 ∈ 𝐶 → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅)))
102	101	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ({𝐽} ∖ 𝐶))) = (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅)))
103		un0 3544	. . . . . . . . 9 ⊢ (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅) = ((1...(𝐽 − 1)) ∖ 𝐶)
104	103	a1i 9	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅) = ((1...(𝐽 − 1)) ∖ 𝐶))
105	104	fveq2d 5676	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘(((1...(𝐽 − 1)) ∖ 𝐶) ∪ ∅)) = (♯‘((1...(𝐽 − 1)) ∖ 𝐶)))
106	97, 102, 105	3eqtrd 2271	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (♯‘((1...𝐽) ∖ 𝐶)) = (♯‘((1...(𝐽 − 1)) ∖ 𝐶)))
107	95, 106	oveq12d 6070	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) + 1) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
108	27	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐽 − 1)) = ((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))))
109	108	oveq1d 6067	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → (((𝐹‘𝐶)‘(𝐽 − 1)) + 1) = (((♯‘((1...(𝐽 − 1)) ∩ 𝐶)) − (♯‘((1...(𝐽 − 1)) ∖ 𝐶))) + 1))
110	77, 107, 109	3eqtr4d 2277	. . . 4 ⊢ ((𝜑 ∧ 𝐽 ∈ 𝐶) → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) = (((𝐹‘𝐶)‘(𝐽 − 1)) + 1))
111	73, 110	eqtrd 2267	. . 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

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 {crab 2526 ∖ cdif 3210 ∪ cun 3211 ∩ cin 3212 ⊆ wss 3213 ∅c0 3510 𝒫 cpw 3671 {csn 3691 ↦ cmpt 4173 ‘cfv 5354 (class class class)co 6052 Fincfn 6977 ℂcc 8127 1c1 8130 + caddc 8132 − cmin 8446 / cdiv 8948 ℕcn 9239 ℕ₀cn0 9498 ℤcz 9579 ℤ_≥cuz 9856 ...cfz 10345 ♯chash 11142

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-in1 619 ax-in2 620 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-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-addcom 8229 ax-addass 8231 ax-distr 8233 ax-i2m1 8234 ax-0lt1 8235 ax-0id 8237 ax-rnegex 8238 ax-cnre 8240 ax-pre-ltirr 8241 ax-pre-ltwlin 8242 ax-pre-lttrn 8243 ax-pre-apti 8244 ax-pre-ltadd 8245

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-recs 6538 df-irdg 6603 df-frec 6624 df-1o 6649 df-oadd 6653 df-er 6769 df-en 6978 df-dom 6979 df-fin 6980 df-pnf 8312 df-mnf 8313 df-xr 8314 df-ltxr 8315 df-le 8316 df-sub 8448 df-neg 8449 df-inn 9240 df-n0 9499 df-z 9580 df-uz 9857 df-fz 10346 df-ihash 11143

This theorem is referenced by: ballotfilemfc0 13153 ballotfilemfcc 13154 ballotfilem4 13159

W3C validator