| 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 12292 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (seq𝑀( · , (𝑍 × {1}))‘𝑘) = 1) |
| 3 | 1ex 8315 | . . . . 5 ⊢ 1 ∈ V | |
| 4 | 3 | fvconst2 5925 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → ((𝑍 × {1})‘𝑘) = 1) |
| 5 | 2, 4 | eqtr4d 2274 | . . 3 ⊢ (𝑘 ∈ 𝑍 → (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘)) |
| 6 | 5 | rgen 2603 | . 2 ⊢ ∀𝑘 ∈ 𝑍 (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘) |
| 7 | id 19 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℤ) | |
| 8 | 1cnd 8336 | . . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → 1 ∈ ℂ) | |
| 9 | 4, 8 | eqeltrd 2315 | . . . . . 6 ⊢ (𝑘 ∈ 𝑍 → ((𝑍 × {1})‘𝑘) ∈ ℂ) |
| 10 | 9 | adantl 277 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ 𝑍) → ((𝑍 × {1})‘𝑘) ∈ ℂ) |
| 11 | 1, 7, 10 | prodf 12288 | . . . 4 ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})):𝑍⟶ℂ) |
| 12 | 11 | ffnd 5532 | . . 3 ⊢ (𝑀 ∈ ℤ → seq𝑀( · , (𝑍 × {1})) Fn 𝑍) |
| 13 | 3 | fconst 5586 | . . . 4 ⊢ (𝑍 × {1}):𝑍⟶{1} |
| 14 | ffn 5531 | . . . 4 ⊢ ((𝑍 × {1}):𝑍⟶{1} → (𝑍 × {1}) Fn 𝑍) | |
| 15 | 13, 14 | ax-mp 5 | . . 3 ⊢ (𝑍 × {1}) Fn 𝑍 |
| 16 | eqfnfv 5800 | . . 3 ⊢ ((seq𝑀( · , (𝑍 × {1})) Fn 𝑍 ∧ (𝑍 × {1}) Fn 𝑍) → (seq𝑀( · , (𝑍 × {1})) = (𝑍 × {1}) ↔ ∀𝑘 ∈ 𝑍 (seq𝑀( · , (𝑍 × {1}))‘𝑘) = ((𝑍 × {1})‘𝑘))) | |
| 17 | 12, 15, 16 | sylancl 417 | . 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 1402 ∈ wcel 2209 ∀wral 2528 {csn 3708 × cxp 4770 Fn wfn 5370 ⟶wf 5371 ‘cfv 5375 ℂcc 8171 1c1 8174 · cmul 8178 ℤcz 9627 ℤ≥cuz 9904 seqcseq 10867 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-ilim 4512 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-recs 6570 df-frec 6656 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-n0 9547 df-z 9628 df-uz 9905 df-fz 10395 df-fzo 10533 df-seqfrec 10868 |
| This theorem is referenced by: prodfclim1 12294 |
| Copyright terms: Public domain | W3C validator |