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

Theorem nfcprod 11327
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.
StepHypRef Expression
1 df-proddc 11323 . 2 𝑘𝐴 𝐵 = (℩𝑦(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴) ∧ (∃𝑛 ∈ (ℤ𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚))))
2 nfcv 2281 . . . . 5 𝑥
3 nfcprod.1 . . . . . . . 8 𝑥𝐴
4 nfcv 2281 . . . . . . . 8 𝑥(ℤ𝑚)
53, 4nfss 3090 . . . . . . 7 𝑥 𝐴 ⊆ (ℤ𝑚)
63nfcri 2275 . . . . . . . . 9 𝑥 𝑗𝐴
76nfdc 1637 . . . . . . . 8 𝑥DECID 𝑗𝐴
84, 7nfralxy 2471 . . . . . . 7 𝑥𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴
95, 8nfan 1544 . . . . . 6 𝑥(𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴)
10 nfv 1508 . . . . . . . . . 10 𝑥 𝑧 # 0
11 nfcv 2281 . . . . . . . . . . . 12 𝑥𝑛
12 nfcv 2281 . . . . . . . . . . . 12 𝑥 ·
133nfcri 2275 . . . . . . . . . . . . . 14 𝑥 𝑘𝐴
14 nfcprod.2 . . . . . . . . . . . . . 14 𝑥𝐵
15 nfcv 2281 . . . . . . . . . . . . . 14 𝑥1
1613, 14, 15nfif 3500 . . . . . . . . . . . . 13 𝑥if(𝑘𝐴, 𝐵, 1)
172, 16nfmpt 4020 . . . . . . . . . . . 12 𝑥(𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))
1811, 12, 17nfseq 10231 . . . . . . . . . . 11 𝑥seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1)))
19 nfcv 2281 . . . . . . . . . . 11 𝑥
20 nfcv 2281 . . . . . . . . . . 11 𝑥𝑧
2118, 19, 20nfbr 3974 . . . . . . . . . 10 𝑥seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧
2210, 21nfan 1544 . . . . . . . . 9 𝑥(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧)
2322nfex 1616 . . . . . . . 8 𝑥𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧)
244, 23nfrexxy 2472 . . . . . . 7 𝑥𝑛 ∈ (ℤ𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧)
25 nfcv 2281 . . . . . . . . 9 𝑥𝑚
2625, 12, 17nfseq 10231 . . . . . . . 8 𝑥seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1)))
27 nfcv 2281 . . . . . . . 8 𝑥𝑦
2826, 19, 27nfbr 3974 . . . . . . 7 𝑥seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦
2924, 28nfan 1544 . . . . . 6 𝑥(∃𝑛 ∈ (ℤ𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)
309, 29nfan 1544 . . . . 5 𝑥((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴) ∧ (∃𝑛 ∈ (ℤ𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦))
312, 30nfrexxy 2472 . . . 4 𝑥𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴) ∧ (∃𝑛 ∈ (ℤ𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦))
32 nfcv 2281 . . . . 5 𝑥
33 nfcv 2281 . . . . . . . 8 𝑥𝑓
34 nfcv 2281 . . . . . . . 8 𝑥(1...𝑚)
3533, 34, 3nff1o 5365 . . . . . . 7 𝑥 𝑓:(1...𝑚)–1-1-onto𝐴
36 nfv 1508 . . . . . . . . . . . 12 𝑥 𝑛𝑚
37 nfcv 2281 . . . . . . . . . . . . 13 𝑥(𝑓𝑛)
3837, 14nfcsb 3037 . . . . . . . . . . . 12 𝑥(𝑓𝑛) / 𝑘𝐵
3936, 38, 15nfif 3500 . . . . . . . . . . 11 𝑥if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)
4032, 39nfmpt 4020 . . . . . . . . . 10 𝑥(𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1))
4115, 12, 40nfseq 10231 . . . . . . . . 9 𝑥seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))
4241, 25nffv 5431 . . . . . . . 8 𝑥(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚)
4342nfeq2 2293 . . . . . . 7 𝑥 𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚)
4435, 43nfan 1544 . . . . . 6 𝑥(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚))
4544nfex 1616 . . . . 5 𝑥𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚))
4632, 45nfrexxy 2472 . . . 4 𝑥𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚))
4731, 46nfor 1553 . . 3 𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴) ∧ (∃𝑛 ∈ (ℤ𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚)))
4847nfiotaw 5092 . 2 𝑥(℩𝑦(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴) ∧ (∃𝑛 ∈ (ℤ𝑚)∃𝑧(𝑧 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑧) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 1)))‘𝑚))))
491, 48nfcxfr 2278 1 𝑥𝑘𝐴 𝐵
Colors of variables: wff set class
Syntax hints:  wa 103  wo 697  DECID wdc 819   = wceq 1331  wex 1468  wcel 1480  wnfc 2268  wral 2416  wrex 2417  csb 3003  wss 3071  ifcif 3474   class class class wbr 3929  cmpt 3989  cio 5086  1-1-ontowf1o 5122  cfv 5123  (class class class)co 5774  0cc0 7623  1c1 7624   · cmul 7628  cle 7804   # cap 8346  cn 8723  cz 9057  cuz 9329  ...cfz 9793  seqcseq 10221  cli 11050  cprod 11322
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-if 3475  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-recs 6202  df-frec 6288  df-seqfrec 10222  df-proddc 11323
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator