Theorem nfcprod 12322

Description: Bound-variable hypothesis builder for product: if 𝑥 is (effectively) not free in 𝐴 and 𝐵, it is not free in ∏𝑘 ∈ 𝐴𝐵. (Contributed by Scott Fenton, 1-Dec-2017.)

Hypotheses

Ref	Expression
nfcprod.1	⊢ Ⅎ𝑥𝐴
nfcprod.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
nfcprod	⊢ Ⅎ𝑥∏𝑘 ∈ 𝐴 𝐵

Distinct variable group:   𝑥,𝑘

Allowed substitution hints:   𝐴(𝑥, 𝑘)   𝐵(𝑥, 𝑘)

Proof of Theorem nfcprod

Dummy variables 𝑓 𝑗 𝑚 𝑛 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-proddc 12318	. 2 ⊢ ∏𝑘 ∈ 𝐴 𝐵 = (℩𝑦(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
2		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑥ℤ
3		nfcprod.1	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
4		nfcv 2392	. . . . . . . 8 ⊢ Ⅎ𝑥(ℤ≥‘𝑚)
5	3, 4	nfss 3241	. . . . . . 7 ⊢ Ⅎ𝑥 𝐴 ⊆ (ℤ≥‘𝑚)
6	3	nfcri 2386	. . . . . . . . 9 ⊢ Ⅎ𝑥 𝑗 ∈ 𝐴
7	6	nfdc 1711	. . . . . . . 8 ⊢ Ⅎ𝑥DECID 𝑗 ∈ 𝐴
8	4, 7	nfralxy 2588	. . . . . . 7 ⊢ Ⅎ𝑥∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴
9	5, 8	nfan 1618	. . . . . 6 ⊢ Ⅎ𝑥(𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)
10		nfv 1581	. . . . . . . . . 10 ⊢ Ⅎ𝑥 𝑧 # 0
11		nfcv 2392	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑛
12		nfcv 2392	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥 ·
13	3	nfcri 2386	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥 𝑘 ∈ 𝐴
14		nfcprod.2	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥𝐵
15		nfcv 2392	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥1
16	13, 14, 15	nfif 3669	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥if(𝑘 ∈ 𝐴, 𝐵, 1)
17	2, 16	nfmpt 4223	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))
18	11, 12, 17	nfseq 10894	. . . . . . . . . . 11 ⊢ Ⅎ𝑥seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1)))
19		nfcv 2392	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 ⇝
20		nfcv 2392	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝑧
21	18, 19, 20	nfbr 4177	. . . . . . . . . 10 ⊢ Ⅎ𝑥seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧
22	10, 21	nfan 1618	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧)
23	22	nfex 1690	. . . . . . . 8 ⊢ Ⅎ𝑥∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧)
24	4, 23	nfrexw 2589	. . . . . . 7 ⊢ Ⅎ𝑥∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧)
25		nfcv 2392	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑚
26	25, 12, 17	nfseq 10894	. . . . . . . 8 ⊢ Ⅎ𝑥seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1)))
27		nfcv 2392	. . . . . . . 8 ⊢ Ⅎ𝑥𝑦
28	26, 19, 27	nfbr 4177	. . . . . . 7 ⊢ Ⅎ𝑥seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦
29	24, 28	nfan 1618	. . . . . 6 ⊢ Ⅎ𝑥(∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦)
30	9, 29	nfan 1618	. . . . 5 ⊢ Ⅎ𝑥((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))
31	2, 30	nfrexw 2589	. . . 4 ⊢ Ⅎ𝑥∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))
32		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑥ℕ
33		nfcv 2392	. . . . . . . 8 ⊢ Ⅎ𝑥𝑓
34		nfcv 2392	. . . . . . . 8 ⊢ Ⅎ𝑥(1...𝑚)
35	33, 34, 3	nff1o 5637	. . . . . . 7 ⊢ Ⅎ𝑥 𝑓:(1...𝑚)–1-1-onto→𝐴
36		nfv 1581	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥 𝑛 ≤ 𝑚
37		nfcv 2392	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(𝑓‘𝑛)
38	37, 14	nfcsb 3185	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥⦋(𝑓‘𝑛) / 𝑘⦌𝐵
39	36, 38, 15	nfif 3669	. . . . . . . . . . 11 ⊢ Ⅎ𝑥if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)
40	32, 39	nfmpt 4223	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1))
41	15, 12, 40	nfseq 10894	. . . . . . . . 9 ⊢ Ⅎ𝑥seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))
42	41, 25	nffv 5705	. . . . . . . 8 ⊢ Ⅎ𝑥(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)
43	42	nfeq2 2404	. . . . . . 7 ⊢ Ⅎ𝑥 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)
44	35, 43	nfan 1618	. . . . . 6 ⊢ Ⅎ𝑥(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))
45	44	nfex 1690	. . . . 5 ⊢ Ⅎ𝑥∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))
46	32, 45	nfrexw 2589	. . . 4 ⊢ Ⅎ𝑥∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))
47	31, 46	nfor 1627	. . 3 ⊢ Ⅎ𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))
48	47	nfiotaw 5341	. 2 ⊢ Ⅎ𝑥(℩𝑦(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
49	1, 48	nfcxfr 2389	1 ⊢ Ⅎ𝑥∏𝑘 ∈ 𝐴 𝐵

This proof depends on syntax axioms:   ∧ 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-dc 847  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-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  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-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:  fprod2dlemstep  12389  fprodcom2fi  12393