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

Theorem nfcprod1 15263
Description: Bound-variable hypothesis builder for product. (Contributed by Scott Fenton, 4-Dec-2017.)
Hypothesis
Ref Expression
nfcprod1.1 𝑘𝐴
Assertion
Ref Expression
nfcprod1 𝑘𝑘𝐴 𝐵
Distinct variable group:   𝐴,𝑘
Allowed substitution hint:   𝐵(𝑘)

Proof of Theorem nfcprod1
Dummy variables 𝑓 𝑚 𝑛 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-prod 15259 . 2 𝑘𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
2 nfcv 2977 . . . . 5 𝑘
3 nfcprod1.1 . . . . . . 7 𝑘𝐴
4 nfcv 2977 . . . . . . 7 𝑘(ℤ𝑚)
53, 4nfss 3959 . . . . . 6 𝑘 𝐴 ⊆ (ℤ𝑚)
6 nfv 1911 . . . . . . . . 9 𝑘 𝑦 ≠ 0
7 nfcv 2977 . . . . . . . . . . 11 𝑘𝑛
8 nfcv 2977 . . . . . . . . . . 11 𝑘 ·
9 nfmpt1 5163 . . . . . . . . . . 11 𝑘(𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))
107, 8, 9nfseq 13378 . . . . . . . . . 10 𝑘seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1)))
11 nfcv 2977 . . . . . . . . . 10 𝑘
12 nfcv 2977 . . . . . . . . . 10 𝑘𝑦
1310, 11, 12nfbr 5112 . . . . . . . . 9 𝑘seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦
146, 13nfan 1896 . . . . . . . 8 𝑘(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)
1514nfex 2339 . . . . . . 7 𝑘𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)
164, 15nfrex 3309 . . . . . 6 𝑘𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)
17 nfcv 2977 . . . . . . . 8 𝑘𝑚
1817, 8, 9nfseq 13378 . . . . . . 7 𝑘seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1)))
19 nfcv 2977 . . . . . . 7 𝑘𝑥
2018, 11, 19nfbr 5112 . . . . . 6 𝑘seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥
215, 16, 20nf3an 1898 . . . . 5 𝑘(𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥)
222, 21nfrex 3309 . . . 4 𝑘𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥)
23 nfcv 2977 . . . . 5 𝑘
24 nfcv 2977 . . . . . . . 8 𝑘𝑓
25 nfcv 2977 . . . . . . . 8 𝑘(1...𝑚)
2624, 25, 3nff1o 6612 . . . . . . 7 𝑘 𝑓:(1...𝑚)–1-1-onto𝐴
27 nfcv 2977 . . . . . . . . . 10 𝑘1
28 nfcsb1v 3906 . . . . . . . . . . 11 𝑘(𝑓𝑛) / 𝑘𝐵
2923, 28nfmpt 5162 . . . . . . . . . 10 𝑘(𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵)
3027, 8, 29nfseq 13378 . . . . . . . . 9 𝑘seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))
3130, 17nffv 6679 . . . . . . . 8 𝑘(seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)
3231nfeq2 2995 . . . . . . 7 𝑘 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)
3326, 32nfan 1896 . . . . . 6 𝑘(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3433nfex 2339 . . . . 5 𝑘𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3523, 34nfrex 3309 . . . 4 𝑘𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3622, 35nfor 1901 . . 3 𝑘(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
3736nfiotaw 6317 . 2 𝑘(℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
381, 37nfcxfr 2975 1 𝑘𝑘𝐴 𝐵
Colors of variables: wff setvar class
Syntax hints:  wa 398  wo 843  w3a 1083   = wceq 1533  wex 1776  wcel 2110  wnfc 2961  wne 3016  wrex 3139  csb 3882  wss 3935  ifcif 4466   class class class wbr 5065  cmpt 5145  cio 6311  1-1-ontowf1o 6353  cfv 6354  (class class class)co 7155  0cc0 10536  1c1 10537   · cmul 10541  cn 11637  cz 11980  cuz 12242  ...cfz 12891  seqcseq 13368  cli 14840  cprod 15258
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-mpt 5146  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-ov 7158  df-oprab 7159  df-mpo 7160  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-seq 13369  df-prod 15259
This theorem is referenced by:  fprodcn  41879  dvmptfprod  42228  vonicc  42966
  Copyright terms: Public domain W3C validator