| 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 12221 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (seq𝑀( · , (𝑍 × {1}))‘𝑘) = 1) |
| 3 | 1ex 8265 | . . . . 5 ⊢ 1 ∈ V | |
| 4 | 3 | fvconst2 5899 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → ((𝑍 × {1})‘𝑘) = 1) |
| 5 | 2, 4 | eqtr4d 2268 | . . 3 ⊢ (𝑘 ∈ 𝑍 → (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘)) |
| 6 | 5 | rgen 2595 | . 2 ⊢ ∀𝑘 ∈ 𝑍 (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘) |
| 7 | id 19 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℤ) | |
| 8 | 1cnd 8286 | . . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → 1 ∈ ℂ) | |
| 9 | 4, 8 | eqeltrd 2309 | . . . . . 6 ⊢ (𝑘 ∈ 𝑍 → ((𝑍 × {1})‘𝑘) ∈ ℂ) |
| 10 | 9 | adantl 277 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ 𝑍) → ((𝑍 × {1})‘𝑘) ∈ ℂ) |
| 11 | 1, 7, 10 | prodf 12217 | . . . 4 ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})):𝑍⟶ℂ) |
| 12 | 11 | ffnd 5508 | . . 3 ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})) Fn 𝑍) |
| 13 | 3 | fconst 5562 | . . . 4 ⊢ (𝑍 × {1}):𝑍⟶{1} |
| 14 | ffn 5507 | . . . 4 ⊢ ((𝑍 × {1}):𝑍⟶{1} → (𝑍 × {1}) Fn 𝑍) | |
| 15 | 13, 14 | ax-mp 5 | . . 3 ⊢ (𝑍 × {1}) Fn 𝑍 |
| 16 | eqfnfv 5774 | . . 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 2203 ∀wral 2520 {csn 3688 × cxp 4746 Fn wfn 5346 ⟶wf 5347 ‘cfv 5351 ℂcc 8121 1c1 8124 · cmul 8128 ℤcz 9573 ℤ≥cuz 9849 seqcseq 10805 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-ltadd 8239 |
| 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 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-inn 9234 df-n0 9493 df-z 9574 df-uz 9850 df-fz 10339 df-fzo 10473 df-seqfrec 10806 |
| This theorem is referenced by: prodfclim1 12223 |
| Copyright terms: Public domain | W3C validator |