Theorem cbvprod 12325

Description: Change bound variable in a product. (Contributed by Scott Fenton, 4-Dec-2017.)

Hypotheses

Ref	Expression
cbvprod.1	⊢ (𝑗 = 𝑘 → 𝐵 = 𝐶)
cbvprod.2	⊢ Ⅎ𝑘𝐴
cbvprod.3	⊢ Ⅎ𝑗𝐴
cbvprod.4	⊢ Ⅎ𝑘𝐵
cbvprod.5	⊢ Ⅎ𝑗𝐶

Assertion

Ref	Expression
cbvprod	⊢ ∏𝑗 ∈ 𝐴 𝐵 = ∏𝑘 ∈ 𝐴 𝐶

Distinct variable group:   𝑗,𝑘

Allowed substitution hints:   𝐴(𝑗, 𝑘)   𝐵(𝑗, 𝑘)   𝐶(𝑗, 𝑘)

Proof of Theorem cbvprod

Dummy variables 𝑓 𝑚 𝑛 𝑠 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvprod.2	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘𝐴
2	1	nfcri 2386	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘 𝑗 ∈ 𝐴
3		cbvprod.4	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘𝐵
4		nfcv 2392	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘1
5	2, 3, 4	nfif 3669	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘if(𝑗 ∈ 𝐴, 𝐵, 1)
6		cbvprod.3	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑗𝐴
7	6	nfcri 2386	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗 𝑘 ∈ 𝐴
8		cbvprod.5	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗𝐶
9		nfcv 2392	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗1
10	7, 8, 9	nfif 3669	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗if(𝑘 ∈ 𝐴, 𝐶, 1)
11		eleq1w 2299	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴))
12		cbvprod.1	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → 𝐵 = 𝐶)
13	11, 12	ifbieq1d 3663	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑘 → if(𝑗 ∈ 𝐴, 𝐵, 1) = if(𝑘 ∈ 𝐴, 𝐶, 1))
14	5, 10, 13	cbvmpt 4226	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1)) = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))
15		seqeq3 10889	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1)) = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1)) → seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) = seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))))
16	14, 15	ax-mp 5	. . . . . . . . . . 11 ⊢ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) = seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1)))
17	16	breq1i 4137	. . . . . . . . . 10 ⊢ (seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦 ↔ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦)
18	17	anbi2i 461	. . . . . . . . 9 ⊢ ((𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ↔ (𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦))
19	18	exbii 1658	. . . . . . . 8 ⊢ (∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ↔ ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦))
20	19	rexbii 2557	. . . . . . 7 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ↔ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦))
21		seqeq3 10889	. . . . . . . . 9 ⊢ ((𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1)) = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1)) → seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) = seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))))
22	14, 21	ax-mp 5	. . . . . . . 8 ⊢ seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) = seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1)))
23	22	breq1i 4137	. . . . . . 7 ⊢ (seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥 ↔ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑥)
24	20, 23	anbi12i 464	. . . . . 6 ⊢ ((∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥) ↔ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑥))
25	24	anbi2i 461	. . . . 5 ⊢ (((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ↔ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑥)))
26	25	rexbii 2557	. . . 4 ⊢ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ↔ ∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑥)))
27	3, 8, 12	cbvcsbw 3151	. . . . . . . . . . . 12 ⊢ ⦋(𝑓‘𝑛) / 𝑗⦌𝐵 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐶
28		ifeq1 3643	. . . . . . . . . . . 12 ⊢ (⦋(𝑓‘𝑛) / 𝑗⦌𝐵 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐶 → if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1) = if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1))
29	27, 28	ax-mp 5	. . . . . . . . . . 11 ⊢ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1) = if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)
30	29	mpteq2i 4218	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1))
31		seqeq3 10889	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)) → seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1))) = seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1))))
32	30, 31	ax-mp 5	. . . . . . . . 9 ⊢ seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1))) = seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))
33	32	fveq1i 5696	. . . . . . . 8 ⊢ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚)
34	33	eqeq2i 2249	. . . . . . 7 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚) ↔ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚))
35	34	anbi2i 461	. . . . . 6 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚)))
36	35	exbii 1658	. . . . 5 ⊢ (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚)))
37	36	rexbii 2557	. . . 4 ⊢ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚)))
38	26, 37	orbi12i 776	. . 3 ⊢ ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚))) ↔ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚))))
39	38	iotabii 5361	. 2 ⊢ (℩𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚)))) = (℩𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚))))
40		df-proddc 12318	. 2 ⊢ ∏𝑗 ∈ 𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑗⦌𝐵, 1)))‘𝑚))))
41		df-proddc 12318	. 2 ⊢ ∏𝑘 ∈ 𝐴 𝐶 = (℩𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑠 ∈ (ℤ≥‘𝑚)DECID 𝑠 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐶, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 1)))‘𝑚))))
42	39, 40, 41	3eqtr4i 2269	1 ⊢ ∏𝑗 ∈ 𝐴 𝐵 = ∏𝑘 ∈ 𝐴 𝐶

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∨ wo 720  DECID wdc 846   = wceq 1402  ∃wex 1545   ∈ wcel 2209  Ⅎwnfc 2379  ∀wral 2528  ∃wrex 2529  ⦋csb 3147   ⊆ wss 3220  ifcif 3638   class class class wbr 4130   ↦ cmpt 4192  ℩cio 5335  –1-1-onto→wf1o 5376  ‘cfv 5377  (class class class)co 6085  0cc0 8179  1c1 8180   · cmul 8184   ≤ cle 8361   # cap 8909  ℕcn 9304  ℤcz 9644  ℤ_≥cuz 9921  ...cfz 10411  seqcseq 10884   ⇝ cli 12044  ∏cprod 12317

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-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-cnv 4782  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-recs 6576  df-frec 6662  df-seqfrec 10885  df-proddc 12318

This theorem is used by:  cbvprodv  12326  cbvprodi  12327