sumodd - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > sumodd		Structured version Visualization version GIF version

Theorem sumodd 16405

Description: If every term in a sum is odd, then the sum is even iff the number of terms in the sum is even. (Contributed by AV, 14-Aug-2021.)

**Hypotheses**
Ref	Expression
sumeven.a	⊢ (𝜑 → 𝐴 ∈ Fin)
sumeven.b	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℤ)
sumodd.o	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 2 ∥ 𝐵)

**Assertion**
Ref	Expression
sumodd	⊢ (𝜑 → (2 ∥ (♯‘𝐴) ↔ 2 ∥ Σ𝑘 ∈ 𝐴 𝐵))

Distinct variable groups: 𝐴,𝑘 𝜑,𝑘 Allowed substitution hint: 𝐵(𝑘)

Proof of Theorem sumodd Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6863	. . . . 5 ⊢ (𝑥 = ∅ → (♯‘𝑥) = (♯‘∅))
2		hash0 14377	. . . . 5 ⊢ (♯‘∅) = 0
3	1, 2	eqtrdi 2812	. . . 4 ⊢ (𝑥 = ∅ → (♯‘𝑥) = 0)
4	3	breq2d 5111	. . 3 ⊢ (𝑥 = ∅ → (2 ∥ (♯‘𝑥) ↔ 2 ∥ 0))
5		sumeq1 15699	. . . . 5 ⊢ (𝑥 = ∅ → Σ𝑘 ∈ 𝑥 𝐵 = Σ𝑘 ∈ ∅ 𝐵)
6		sum0 15731	. . . . 5 ⊢ Σ𝑘 ∈ ∅ 𝐵 = 0
7	5, 6	eqtrdi 2812	. . . 4 ⊢ (𝑥 = ∅ → Σ𝑘 ∈ 𝑥 𝐵 = 0)
8	7	breq2d 5111	. . 3 ⊢ (𝑥 = ∅ → (2 ∥ Σ𝑘 ∈ 𝑥 𝐵 ↔ 2 ∥ 0))
9	4, 8	bibi12d 347	. 2 ⊢ (𝑥 = ∅ → ((2 ∥ (♯‘𝑥) ↔ 2 ∥ Σ𝑘 ∈ 𝑥 𝐵) ↔ (2 ∥ 0 ↔ 2 ∥ 0)))
10		fveq2 6863	. . . 4 ⊢ (𝑥 = 𝑦 → (♯‘𝑥) = (♯‘𝑦))
11	10	breq2d 5111	. . 3 ⊢ (𝑥 = 𝑦 → (2 ∥ (♯‘𝑥) ↔ 2 ∥ (♯‘𝑦)))
12		sumeq1 15699	. . . 4 ⊢ (𝑥 = 𝑦 → Σ𝑘 ∈ 𝑥 𝐵 = Σ𝑘 ∈ 𝑦 𝐵)
13	12	breq2d 5111	. . 3 ⊢ (𝑥 = 𝑦 → (2 ∥ Σ𝑘 ∈ 𝑥 𝐵 ↔ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵))
14	11, 13	bibi12d 347	. 2 ⊢ (𝑥 = 𝑦 → ((2 ∥ (♯‘𝑥) ↔ 2 ∥ Σ𝑘 ∈ 𝑥 𝐵) ↔ (2 ∥ (♯‘𝑦) ↔ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵)))
15		fveq2 6863	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (♯‘𝑥) = (♯‘(𝑦 ∪ {𝑧})))
16	15	breq2d 5111	. . 3 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (2 ∥ (♯‘𝑥) ↔ 2 ∥ (♯‘(𝑦 ∪ {𝑧}))))
17		sumeq1 15699	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → Σ𝑘 ∈ 𝑥 𝐵 = Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵)
18	17	breq2d 5111	. . 3 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (2 ∥ Σ𝑘 ∈ 𝑥 𝐵 ↔ 2 ∥ Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵))
19	16, 18	bibi12d 347	. 2 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((2 ∥ (♯‘𝑥) ↔ 2 ∥ Σ𝑘 ∈ 𝑥 𝐵) ↔ (2 ∥ (♯‘(𝑦 ∪ {𝑧})) ↔ 2 ∥ Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵)))
20		fveq2 6863	. . . 4 ⊢ (𝑥 = 𝐴 → (♯‘𝑥) = (♯‘𝐴))
21	20	breq2d 5111	. . 3 ⊢ (𝑥 = 𝐴 → (2 ∥ (♯‘𝑥) ↔ 2 ∥ (♯‘𝐴)))
22		sumeq1 15699	. . . 4 ⊢ (𝑥 = 𝐴 → Σ𝑘 ∈ 𝑥 𝐵 = Σ𝑘 ∈ 𝐴 𝐵)
23	22	breq2d 5111	. . 3 ⊢ (𝑥 = 𝐴 → (2 ∥ Σ𝑘 ∈ 𝑥 𝐵 ↔ 2 ∥ Σ𝑘 ∈ 𝐴 𝐵))
24	21, 23	bibi12d 347	. 2 ⊢ (𝑥 = 𝐴 → ((2 ∥ (♯‘𝑥) ↔ 2 ∥ Σ𝑘 ∈ 𝑥 𝐵) ↔ (2 ∥ (♯‘𝐴) ↔ 2 ∥ Σ𝑘 ∈ 𝐴 𝐵)))
25		biidd 264	. 2 ⊢ (𝜑 → (2 ∥ 0 ↔ 2 ∥ 0))
26		eldifi 4084	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ (𝐴 ∖ 𝑦) → 𝑧 ∈ 𝐴)
27	26	adantl 485	. . . . . . . . . . . . 13 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → 𝑧 ∈ 𝐴)
28	27	adantl 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → 𝑧 ∈ 𝐴)
29		sumeven.b	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℤ)
30	29	adantlr 725	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℤ)
31	30	ralrimiva 3153	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℤ)
32		rspcsbela 4391	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 𝐵 ∈ ℤ) → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ)
33	28, 31, 32	syl2anc 593	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ)
34		sumodd.o	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 2 ∥ 𝐵)
35	34	ralrimiva 3153	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 ¬ 2 ∥ 𝐵)
36		nfcv 2923	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘2
37		nfcv 2923	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘 ∥
38		nfcsb1v 3876	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘⦋𝑧 / 𝑘⦌𝐵
39	36, 37, 38	nfbr 5146	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘2 ∥ ⦋𝑧 / 𝑘⦌𝐵
40	39	nfn 1876	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘 ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵
41		csbeq1a 3866	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑧 → 𝐵 = ⦋𝑧 / 𝑘⦌𝐵)
42	41	breq2d 5111	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑧 → (2 ∥ 𝐵 ↔ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
43	42	notbid 320	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑧 → (¬ 2 ∥ 𝐵 ↔ ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
44	40, 43	rspc 3569	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝐴 → (∀𝑘 ∈ 𝐴 ¬ 2 ∥ 𝐵 → ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
45	26, 44	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ (𝐴 ∖ 𝑦) → (∀𝑘 ∈ 𝐴 ¬ 2 ∥ 𝐵 → ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
46	35, 45	syl5com 31	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑧 ∈ (𝐴 ∖ 𝑦) → ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
47	46	a1d 25	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑦 ⊆ 𝐴 → (𝑧 ∈ (𝐴 ∖ 𝑦) → ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵)))
48	47	imp32 422	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵)
49	33, 48	jca 519	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ ∧ ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
50	49	adantr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → (⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ ∧ ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
51		sumeven.a	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ Fin)
52		ssfi 9137	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ Fin ∧ 𝑦 ⊆ 𝐴) → 𝑦 ∈ Fin)
53	52	expcom 417	. . . . . . . . . . . . . 14 ⊢ (𝑦 ⊆ 𝐴 → (𝐴 ∈ Fin → 𝑦 ∈ Fin))
54	53	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → (𝐴 ∈ Fin → 𝑦 ∈ Fin))
55	51, 54	syl5com 31	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → 𝑦 ∈ Fin))
56	55	imp 410	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → 𝑦 ∈ Fin)
57		simpll 776	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝜑)
58		ssel 3930	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ⊆ 𝐴 → (𝑘 ∈ 𝑦 → 𝑘 ∈ 𝐴))
59	58	adantr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → (𝑘 ∈ 𝑦 → 𝑘 ∈ 𝐴))
60	59	adantl 485	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (𝑘 ∈ 𝑦 → 𝑘 ∈ 𝐴))
61	60	imp 410	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝑘 ∈ 𝐴)
62	57, 61, 29	syl2anc 593	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝐵 ∈ ℤ)
63	56, 62	fsumzcl 15745	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → Σ𝑘 ∈ 𝑦 𝐵 ∈ ℤ)
64	63	anim1i 624	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → (Σ𝑘 ∈ 𝑦 𝐵 ∈ ℤ ∧ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵))
65		opeo 16382	. . . . . . . . 9 ⊢ (((⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ ∧ ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵) ∧ (Σ𝑘 ∈ 𝑦 𝐵 ∈ ℤ ∧ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵)) → ¬ 2 ∥ (⦋𝑧 / 𝑘⦌𝐵 + Σ𝑘 ∈ 𝑦 𝐵))
66	50, 64, 65	syl2anc 593	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → ¬ 2 ∥ (⦋𝑧 / 𝑘⦌𝐵 + Σ𝑘 ∈ 𝑦 𝐵))
67	63	zcnd 12675	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → Σ𝑘 ∈ 𝑦 𝐵 ∈ ℂ)
68	33	zcnd 12675	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℂ)
69		addcom 11366	. . . . . . . . . . . 12 ⊢ ((Σ𝑘 ∈ 𝑦 𝐵 ∈ ℂ ∧ ⦋𝑧 / 𝑘⦌𝐵 ∈ ℂ) → (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) = (⦋𝑧 / 𝑘⦌𝐵 + Σ𝑘 ∈ 𝑦 𝐵))
70	69	breq2d 5111	. . . . . . . . . . 11 ⊢ ((Σ𝑘 ∈ 𝑦 𝐵 ∈ ℂ ∧ ⦋𝑧 / 𝑘⦌𝐵 ∈ ℂ) → (2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) ↔ 2 ∥ (⦋𝑧 / 𝑘⦌𝐵 + Σ𝑘 ∈ 𝑦 𝐵)))
71	70	notbid 320	. . . . . . . . . 10 ⊢ ((Σ𝑘 ∈ 𝑦 𝐵 ∈ ℂ ∧ ⦋𝑧 / 𝑘⦌𝐵 ∈ ℂ) → (¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) ↔ ¬ 2 ∥ (⦋𝑧 / 𝑘⦌𝐵 + Σ𝑘 ∈ 𝑦 𝐵)))
72	67, 68, 71	syl2anc 593	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) ↔ ¬ 2 ∥ (⦋𝑧 / 𝑘⦌𝐵 + Σ𝑘 ∈ 𝑦 𝐵)))
73	72	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → (¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) ↔ ¬ 2 ∥ (⦋𝑧 / 𝑘⦌𝐵 + Σ𝑘 ∈ 𝑦 𝐵)))
74	66, 73	mpbird 259	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))
75	74	ex 416	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (2 ∥ Σ𝑘 ∈ 𝑦 𝐵 → ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)))
76	63	anim1i 624	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ ¬ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → (Σ𝑘 ∈ 𝑦 𝐵 ∈ ℤ ∧ ¬ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵))
77	49	adantr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ ¬ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → (⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ ∧ ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵))
78		opoe 16380	. . . . . . . . 9 ⊢ (((Σ𝑘 ∈ 𝑦 𝐵 ∈ ℤ ∧ ¬ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) ∧ (⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ ∧ ¬ 2 ∥ ⦋𝑧 / 𝑘⦌𝐵)) → 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))
79	76, 77, 78	syl2anc 593	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ ¬ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))
80	79	ex 416	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (¬ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵 → 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)))
81	80	con1d 145	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) → 2 ∥ Σ𝑘 ∈ 𝑦 𝐵))
82	75, 81	impbid 214	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (2 ∥ Σ𝑘 ∈ 𝑦 𝐵 ↔ ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)))
83		bitr3 354	. . . . 5 ⊢ ((2 ∥ Σ𝑘 ∈ 𝑦 𝐵 ↔ ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)) → ((2 ∥ Σ𝑘 ∈ 𝑦 𝐵 ↔ ¬ 2 ∥ ((♯‘𝑦) + 1)) → (¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) ↔ ¬ 2 ∥ ((♯‘𝑦) + 1))))
84	82, 83	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ((2 ∥ Σ𝑘 ∈ 𝑦 𝐵 ↔ ¬ 2 ∥ ((♯‘𝑦) + 1)) → (¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) ↔ ¬ 2 ∥ ((♯‘𝑦) + 1))))
85		bicom 224	. . . 4 ⊢ ((¬ 2 ∥ ((♯‘𝑦) + 1) ↔ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) ↔ (2 ∥ Σ𝑘 ∈ 𝑦 𝐵 ↔ ¬ 2 ∥ ((♯‘𝑦) + 1)))
86		bicom 224	. . . 4 ⊢ ((¬ 2 ∥ ((♯‘𝑦) + 1) ↔ ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)) ↔ (¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵) ↔ ¬ 2 ∥ ((♯‘𝑦) + 1)))
87	84, 85, 86	3imtr4g 298	. . 3 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ((¬ 2 ∥ ((♯‘𝑦) + 1) ↔ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → (¬ 2 ∥ ((♯‘𝑦) + 1) ↔ ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))))
88		notnotb 317	. . . . 5 ⊢ (2 ∥ (♯‘𝑦) ↔ ¬ ¬ 2 ∥ (♯‘𝑦))
89		hashcl 14366	. . . . . . . . 9 ⊢ (𝑦 ∈ Fin → (♯‘𝑦) ∈ ℕ₀)
90	56, 89	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (♯‘𝑦) ∈ ℕ₀)
91	90	nn0zd 12590	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (♯‘𝑦) ∈ ℤ)
92		oddp1even 16361	. . . . . . 7 ⊢ ((♯‘𝑦) ∈ ℤ → (¬ 2 ∥ (♯‘𝑦) ↔ 2 ∥ ((♯‘𝑦) + 1)))
93	91, 92	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (¬ 2 ∥ (♯‘𝑦) ↔ 2 ∥ ((♯‘𝑦) + 1)))
94	93	notbid 320	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (¬ ¬ 2 ∥ (♯‘𝑦) ↔ ¬ 2 ∥ ((♯‘𝑦) + 1)))
95	88, 94	bitrid 285	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (2 ∥ (♯‘𝑦) ↔ ¬ 2 ∥ ((♯‘𝑦) + 1)))
96	95	bibi1d 345	. . 3 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ((2 ∥ (♯‘𝑦) ↔ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) ↔ (¬ 2 ∥ ((♯‘𝑦) + 1) ↔ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵)))
97		simprr 782	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → 𝑧 ∈ (𝐴 ∖ 𝑦))
98		eldifn 4085	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝐴 ∖ 𝑦) → ¬ 𝑧 ∈ 𝑦)
99	98	adantl 485	. . . . . . . . 9 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → ¬ 𝑧 ∈ 𝑦)
100	99	adantl 485	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ¬ 𝑧 ∈ 𝑦)
101	56, 100	jca 519	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦))
102		hashunsng 14402	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 ∖ 𝑦) → ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → (♯‘(𝑦 ∪ {𝑧})) = ((♯‘𝑦) + 1)))
103	97, 101, 102	sylc 65	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (♯‘(𝑦 ∪ {𝑧})) = ((♯‘𝑦) + 1))
104	103	breq2d 5111	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (2 ∥ (♯‘(𝑦 ∪ {𝑧})) ↔ 2 ∥ ((♯‘𝑦) + 1)))
105		vex 3457	. . . . . . . 8 ⊢ 𝑧 ∈ V
106	105	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → 𝑧 ∈ V)
107		df-nel 3061	. . . . . . . 8 ⊢ (𝑧 ∉ 𝑦 ↔ ¬ 𝑧 ∈ 𝑦)
108	100, 107	sylibr 236	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → 𝑧 ∉ 𝑦)
109		simpll 776	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ (𝑦 ∪ {𝑧})) → 𝜑)
110		elun 4106	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (𝑦 ∪ {𝑧}) ↔ (𝑘 ∈ 𝑦 ∨ 𝑘 ∈ {𝑧}))
111	59	com12 32	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ 𝑦 → ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → 𝑘 ∈ 𝐴))
112		elsni 4598	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ {𝑧} → 𝑘 = 𝑧)
113		eleq1w 2844	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑧 → (𝑘 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
114	27, 113	imbitrrid 248	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑧 → ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → 𝑘 ∈ 𝐴))
115	112, 114	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ {𝑧} → ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → 𝑘 ∈ 𝐴))
116	111, 115	jaoi 868	. . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ 𝑦 ∨ 𝑘 ∈ {𝑧}) → ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → 𝑘 ∈ 𝐴))
117	110, 116	sylbi 219	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (𝑦 ∪ {𝑧}) → ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → 𝑘 ∈ 𝐴))
118	117	com12 32	. . . . . . . . . . 11 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦)) → (𝑘 ∈ (𝑦 ∪ {𝑧}) → 𝑘 ∈ 𝐴))
119	118	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (𝑘 ∈ (𝑦 ∪ {𝑧}) → 𝑘 ∈ 𝐴))
120	119	imp 410	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ (𝑦 ∪ {𝑧})) → 𝑘 ∈ 𝐴)
121	109, 120, 29	syl2anc 593	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ (𝑦 ∪ {𝑧})) → 𝐵 ∈ ℤ)
122	121	ralrimiva 3153	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ∀𝑘 ∈ (𝑦 ∪ {𝑧})𝐵 ∈ ℤ)
123		fsumsplitsnun 15765	. . . . . . 7 ⊢ ((𝑦 ∈ Fin ∧ (𝑧 ∈ V ∧ 𝑧 ∉ 𝑦) ∧ ∀𝑘 ∈ (𝑦 ∪ {𝑧})𝐵 ∈ ℤ) → Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵 = (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))
124	56, 106, 108, 122, 123	syl121anc 1393	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵 = (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))
125	124	breq2d 5111	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (2 ∥ Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵 ↔ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)))
126	104, 125	bibi12d 347	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ((2 ∥ (♯‘(𝑦 ∪ {𝑧})) ↔ 2 ∥ Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵) ↔ (2 ∥ ((♯‘𝑦) + 1) ↔ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))))
127		notbi 321	. . . 4 ⊢ ((2 ∥ ((♯‘𝑦) + 1) ↔ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)) ↔ (¬ 2 ∥ ((♯‘𝑦) + 1) ↔ ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵)))
128	126, 127	bitrdi 289	. . 3 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ((2 ∥ (♯‘(𝑦 ∪ {𝑧})) ↔ 2 ∥ Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵) ↔ (¬ 2 ∥ ((♯‘𝑦) + 1) ↔ ¬ 2 ∥ (Σ𝑘 ∈ 𝑦 𝐵 + ⦋𝑧 / 𝑘⦌𝐵))))
129	87, 96, 128	3imtr4d 296	. 2 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → ((2 ∥ (♯‘𝑦) ↔ 2 ∥ Σ𝑘 ∈ 𝑦 𝐵) → (2 ∥ (♯‘(𝑦 ∪ {𝑧})) ↔ 2 ∥ Σ𝑘 ∈ (𝑦 ∪ {𝑧})𝐵)))
130	9, 14, 19, 24, 25, 129, 51	findcard2d 9131	1 ⊢ (𝜑 → (2 ∥ (♯‘𝐴) ↔ 2 ∥ Σ𝑘 ∈ 𝐴 𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 = wceq 1559 ∈ wcel 2141 ∉ wnel 3060 ∀wral 3075 Vcvv 3453 ⦋csb 3852 ∖ cdif 3901 ∪ cun 3902 ⊆ wss 3904 ∅c0 4285 {csn 4581 class class class wbr 5099 ‘cfv 6517 (class class class)co 7392 Fincfn 8923 ℂcc 11068 0cc0 11070 1c1 11071 + caddc 11073 2c2 12269 ℕ₀cn0 12478 ℤcz 12565 ♯chash 14340 Σcsu 15696 ∥ cdvds 16269

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-inf2 9593 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 ax-pre-sup 11148

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-isom 6526 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-oadd 8436 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-sup 9385 df-oi 9455 df-dju 9856 df-card 9894 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12208 df-2 12277 df-3 12278 df-n0 12479 df-z 12566 df-uz 12837 df-rp 12991 df-fz 13510 df-fzo 13657 df-seq 14012 df-exp 14072 df-hash 14341 df-cj 15109 df-re 15110 df-im 15111 df-sqrt 15245 df-abs 15246 df-clim 15498 df-sum 15697 df-dvds 16270

This theorem is referenced by: evensumodd 16406 oddsumodd 16407 vtxdgoddnumeven 29700

W3C validator