| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > prodf1f | GIF version | ||
| Description: A one-valued infinite product is equal to the constant one function. (Contributed by Scott Fenton, 5-Dec-2017.) |
| Ref | Expression |
|---|---|
| prodf1.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| Ref | Expression |
|---|---|
| prodf1f | ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})) = (𝑍 × {1})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prodf1.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | 1 | prodf1 12256 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (seq𝑀( · , (𝑍 × {1}))‘𝑘) = 1) |
| 3 | 1ex 8285 | . . . . 5 ⊢ 1 ∈ V | |
| 4 | 3 | fvconst2 5905 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → ((𝑍 × {1})‘𝑘) = 1) |
| 5 | 2, 4 | eqtr4d 2270 | . . 3 ⊢ (𝑘 ∈ 𝑍 → (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘)) |
| 6 | 5 | rgen 2597 | . 2 ⊢ ∀𝑘 ∈ 𝑍 (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘) |
| 7 | id 19 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℤ) | |
| 8 | 1cnd 8306 | . . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → 1 ∈ ℂ) | |
| 9 | 4, 8 | eqeltrd 2311 | . . . . . 6 ⊢ (𝑘 ∈ 𝑍 → ((𝑍 × {1})‘𝑘) ∈ ℂ) |
| 10 | 9 | adantl 277 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ 𝑍) → ((𝑍 × {1})‘𝑘) ∈ ℂ) |
| 11 | 1, 7, 10 | prodf 12252 | . . . 4 ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})):𝑍⟶ℂ) |
| 12 | 11 | ffnd 5514 | . . 3 ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})) Fn 𝑍) |
| 13 | 3 | fconst 5568 | . . . 4 ⊢ (𝑍 × {1}):𝑍⟶{1} |
| 14 | ffn 5513 | . . . 4 ⊢ ((𝑍 × {1}):𝑍⟶{1} → (𝑍 × {1}) Fn 𝑍) | |
| 15 | 13, 14 | ax-mp 5 | . . 3 ⊢ (𝑍 × {1}) Fn 𝑍 |
| 16 | eqfnfv 5780 | . . 3 ⊢ ((seq𝑀( · , (𝑍 × {1})) Fn 𝑍 ∧ (𝑍 × {1}) Fn 𝑍) → (seq𝑀( · , (𝑍 × {1})) = (𝑍 × {1}) ↔ ∀𝑘 ∈ 𝑍 (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘))) | |
| 17 | 12, 15, 16 | sylancl 413 | . 2 ⊢ (𝑀 ∈ ℤ → (seq𝑀( · , (𝑍 × {1})) = (𝑍 × {1}) ↔ ∀𝑘 ∈ 𝑍 (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘))) |
| 18 | 6, 17 | mpbiri 168 | 1 ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})) = (𝑍 × {1})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∈ wcel 2205 ∀wral 2522 {csn 3694 × cxp 4752 Fn wfn 5352 ⟶wf 5353 ‘cfv 5357 ℂcc 8141 1c1 8144 · cmul 8148 ℤcz 9597 ℤ≥cuz 9874 seqcseq 10836 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-ltadd 8259 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8463 df-neg 8464 df-inn 9258 df-n0 9517 df-z 9598 df-uz 9875 df-fz 10365 df-fzo 10502 df-seqfrec 10837 |
| This theorem is referenced by: prodfclim1 12258 |
| Copyright terms: Public domain | W3C validator |