| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fmul01lt1 | Structured version Visualization version GIF version | ||
| Description: Given a finite multiplication of values between 0 and 1, a value E larger than any multiplicand, is larger than the whole multiplication. (Contributed by Glauco Siliprandi, 20-Apr-2017.) |
| Ref | Expression |
|---|---|
| fmul01lt1.1 | ⊢ Ⅎ𝑖𝐵 |
| fmul01lt1.2 | ⊢ Ⅎ𝑖𝜑 |
| fmul01lt1.3 | ⊢ Ⅎ𝑗𝐴 |
| fmul01lt1.4 | ⊢ 𝐴 = seq1( · , 𝐵) |
| fmul01lt1.5 | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| fmul01lt1.6 | ⊢ (𝜑 → 𝐵:(1...𝑀)⟶ℝ) |
| fmul01lt1.7 | ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 0 ≤ (𝐵‘𝑖)) |
| fmul01lt1.8 | ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ≤ 1) |
| fmul01lt1.9 | ⊢ (𝜑 → 𝐸 ∈ ℝ+) |
| fmul01lt1.10 | ⊢ (𝜑 → ∃𝑗 ∈ (1...𝑀)(𝐵‘𝑗) < 𝐸) |
| Ref | Expression |
|---|---|
| fmul01lt1 | ⊢ (𝜑 → (𝐴‘𝑀) < 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fmul01lt1.10 | . 2 ⊢ (𝜑 → ∃𝑗 ∈ (1...𝑀)(𝐵‘𝑗) < 𝐸) | |
| 2 | nfv 1916 | . . 3 ⊢ Ⅎ𝑗𝜑 | |
| 3 | fmul01lt1.3 | . . . . 5 ⊢ Ⅎ𝑗𝐴 | |
| 4 | nfcv 2899 | . . . . 5 ⊢ Ⅎ𝑗𝑀 | |
| 5 | 3, 4 | nffv 6852 | . . . 4 ⊢ Ⅎ𝑗(𝐴‘𝑀) |
| 6 | nfcv 2899 | . . . 4 ⊢ Ⅎ𝑗 < | |
| 7 | nfcv 2899 | . . . 4 ⊢ Ⅎ𝑗𝐸 | |
| 8 | 5, 6, 7 | nfbr 5147 | . . 3 ⊢ Ⅎ𝑗(𝐴‘𝑀) < 𝐸 |
| 9 | fmul01lt1.1 | . . . . 5 ⊢ Ⅎ𝑖𝐵 | |
| 10 | fmul01lt1.2 | . . . . . 6 ⊢ Ⅎ𝑖𝜑 | |
| 11 | nfv 1916 | . . . . . 6 ⊢ Ⅎ𝑖 𝑗 ∈ (1...𝑀) | |
| 12 | nfcv 2899 | . . . . . . . 8 ⊢ Ⅎ𝑖𝑗 | |
| 13 | 9, 12 | nffv 6852 | . . . . . . 7 ⊢ Ⅎ𝑖(𝐵‘𝑗) |
| 14 | nfcv 2899 | . . . . . . 7 ⊢ Ⅎ𝑖 < | |
| 15 | nfcv 2899 | . . . . . . 7 ⊢ Ⅎ𝑖𝐸 | |
| 16 | 13, 14, 15 | nfbr 5147 | . . . . . 6 ⊢ Ⅎ𝑖(𝐵‘𝑗) < 𝐸 |
| 17 | 10, 11, 16 | nf3an 1903 | . . . . 5 ⊢ Ⅎ𝑖(𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) |
| 18 | fmul01lt1.4 | . . . . 5 ⊢ 𝐴 = seq1( · , 𝐵) | |
| 19 | 1zzd 12534 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → 1 ∈ ℤ) | |
| 20 | fmul01lt1.5 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
| 21 | elnnuz 12803 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (ℤ≥‘1)) | |
| 22 | 20, 21 | sylib 218 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘1)) |
| 23 | 22 | 3ad2ant1 1134 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → 𝑀 ∈ (ℤ≥‘1)) |
| 24 | fmul01lt1.6 | . . . . . . 7 ⊢ (𝜑 → 𝐵:(1...𝑀)⟶ℝ) | |
| 25 | 24 | ffvelcdmda 7038 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ∈ ℝ) |
| 26 | 25 | 3ad2antl1 1187 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ∈ ℝ) |
| 27 | fmul01lt1.7 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 0 ≤ (𝐵‘𝑖)) | |
| 28 | 27 | 3ad2antl1 1187 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) ∧ 𝑖 ∈ (1...𝑀)) → 0 ≤ (𝐵‘𝑖)) |
| 29 | fmul01lt1.8 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ≤ 1) | |
| 30 | 29 | 3ad2antl1 1187 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ≤ 1) |
| 31 | fmul01lt1.9 | . . . . . 6 ⊢ (𝜑 → 𝐸 ∈ ℝ+) | |
| 32 | 31 | 3ad2ant1 1134 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → 𝐸 ∈ ℝ+) |
| 33 | simp2 1138 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → 𝑗 ∈ (1...𝑀)) | |
| 34 | simp3 1139 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → (𝐵‘𝑗) < 𝐸) | |
| 35 | 9, 17, 18, 19, 23, 26, 28, 30, 32, 33, 34 | fmul01lt1lem2 45945 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → (𝐴‘𝑀) < 𝐸) |
| 36 | 35 | 3exp 1120 | . . 3 ⊢ (𝜑 → (𝑗 ∈ (1...𝑀) → ((𝐵‘𝑗) < 𝐸 → (𝐴‘𝑀) < 𝐸))) |
| 37 | 2, 8, 36 | rexlimd 3245 | . 2 ⊢ (𝜑 → (∃𝑗 ∈ (1...𝑀)(𝐵‘𝑗) < 𝐸 → (𝐴‘𝑀) < 𝐸)) |
| 38 | 1, 37 | mpd 15 | 1 ⊢ (𝜑 → (𝐴‘𝑀) < 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 Ⅎwnf 1785 ∈ wcel 2114 Ⅎwnfc 2884 ∃wrex 3062 class class class wbr 5100 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 0cc0 11038 1c1 11039 · cmul 11043 < clt 11178 ≤ cle 11179 ℕcn 12157 ℤ≥cuz 12763 ℝ+crp 12917 ...cfz 13435 seqcseq 13936 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 df-fz 13436 df-fzo 13583 df-seq 13937 |
| This theorem is referenced by: stoweidlem48 46406 |
| Copyright terms: Public domain | W3C validator |