| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prodex | Structured version Visualization version GIF version | ||
| Description: A product is a set. (Contributed by Scott Fenton, 4-Dec-2017.) |
| Ref | Expression |
|---|---|
| prodex | ⊢ ∏𝑘 ∈ 𝐴 𝐵 ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-prod 15993 | . 2 ⊢ ∏𝑘 ∈ 𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ ⦋(𝑓‘𝑛) / 𝑘⦌𝐵))‘𝑚)))) | |
| 2 | iotaex 6509 | . 2 ⊢ (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ ⦋(𝑓‘𝑛) / 𝑘⦌𝐵))‘𝑚)))) ∈ V | |
| 3 | 1, 2 | eqeltri 2856 | 1 ⊢ ∏𝑘 ∈ 𝐴 𝐵 ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2955 ∃wrex 3086 Vcvv 3450 ⦋csb 3847 ⊆ wss 3899 ifcif 4482 class class class wbr 5103 ↦ cmpt 5186 ℩cio 6487 –1-1-onto→wf1o 6532 ‘cfv 6533 (class class class)co 7413 0cc0 11124 1c1 11125 · cmul 11129 ℕcn 12257 ℤcz 12615 ℤ≥cuz 12887 ...cfz 13561 seqcseq 14065 ⇝ cli 15571 ∏cprod 15992 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-nul 5263 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-v 3452 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-sn 4585 df-pr 4587 df-uni 4868 df-iota 6489 df-prod 15993 |
| This theorem is used by: risefacval 16095 fallfacval 16096 prmoval 17125 fprodsubrecnncnvlem 46735 fprodaddrecnncnvlem 46737 etransclem13 47075 ovnlecvr 47386 ovncvrrp 47392 hoidmvval 47405 vonioolem1 47508 |
| Copyright terms: Public domain | W3C validator |