![]() |
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 betweeen 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 1918 | . . 3 ⊢ Ⅎ𝑗𝜑 | |
3 | fmul01lt1.3 | . . . . 5 ⊢ Ⅎ𝑗𝐴 | |
4 | nfcv 2906 | . . . . 5 ⊢ Ⅎ𝑗𝑀 | |
5 | 3, 4 | nffv 6850 | . . . 4 ⊢ Ⅎ𝑗(𝐴‘𝑀) |
6 | nfcv 2906 | . . . 4 ⊢ Ⅎ𝑗 < | |
7 | nfcv 2906 | . . . 4 ⊢ Ⅎ𝑗𝐸 | |
8 | 5, 6, 7 | nfbr 5151 | . . 3 ⊢ Ⅎ𝑗(𝐴‘𝑀) < 𝐸 |
9 | fmul01lt1.1 | . . . . 5 ⊢ Ⅎ𝑖𝐵 | |
10 | fmul01lt1.2 | . . . . . 6 ⊢ Ⅎ𝑖𝜑 | |
11 | nfv 1918 | . . . . . 6 ⊢ Ⅎ𝑖 𝑗 ∈ (1...𝑀) | |
12 | nfcv 2906 | . . . . . . . 8 ⊢ Ⅎ𝑖𝑗 | |
13 | 9, 12 | nffv 6850 | . . . . . . 7 ⊢ Ⅎ𝑖(𝐵‘𝑗) |
14 | nfcv 2906 | . . . . . . 7 ⊢ Ⅎ𝑖 < | |
15 | nfcv 2906 | . . . . . . 7 ⊢ Ⅎ𝑖𝐸 | |
16 | 13, 14, 15 | nfbr 5151 | . . . . . 6 ⊢ Ⅎ𝑖(𝐵‘𝑗) < 𝐸 |
17 | 10, 11, 16 | nf3an 1905 | . . . . 5 ⊢ Ⅎ𝑖(𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) |
18 | fmul01lt1.4 | . . . . 5 ⊢ 𝐴 = seq1( · , 𝐵) | |
19 | 1zzd 12493 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → 1 ∈ ℤ) | |
20 | fmul01lt1.5 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
21 | elnnuz 12762 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (ℤ≥‘1)) | |
22 | 20, 21 | sylib 217 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘1)) |
23 | 22 | 3ad2ant1 1134 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → 𝑀 ∈ (ℤ≥‘1)) |
24 | fmul01lt1.6 | . . . . . . 7 ⊢ (𝜑 → 𝐵:(1...𝑀)⟶ℝ) | |
25 | 24 | ffvelcdmda 7032 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ∈ ℝ) |
26 | 25 | 3ad2antl1 1186 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ∈ ℝ) |
27 | fmul01lt1.7 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 0 ≤ (𝐵‘𝑖)) | |
28 | 27 | 3ad2antl1 1186 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) ∧ 𝑖 ∈ (1...𝑀)) → 0 ≤ (𝐵‘𝑖)) |
29 | fmul01lt1.8 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐵‘𝑖) ≤ 1) | |
30 | 29 | 3ad2antl1 1186 | . . . . 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 43721 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ (𝐵‘𝑗) < 𝐸) → (𝐴‘𝑀) < 𝐸) |
36 | 35 | 3exp 1120 | . . 3 ⊢ (𝜑 → (𝑗 ∈ (1...𝑀) → ((𝐵‘𝑗) < 𝐸 → (𝐴‘𝑀) < 𝐸))) |
37 | 2, 8, 36 | rexlimd 3248 | . 2 ⊢ (𝜑 → (∃𝑗 ∈ (1...𝑀)(𝐵‘𝑗) < 𝐸 → (𝐴‘𝑀) < 𝐸)) |
38 | 1, 37 | mpd 15 | 1 ⊢ (𝜑 → (𝐴‘𝑀) < 𝐸) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 Ⅎwnf 1786 ∈ wcel 2107 Ⅎwnfc 2886 ∃wrex 3072 class class class wbr 5104 ⟶wf 6490 ‘cfv 6494 (class class class)co 7352 ℝcr 11009 0cc0 11010 1c1 11011 · cmul 11015 < clt 11148 ≤ cle 11149 ℕcn 12112 ℤ≥cuz 12722 ℝ+crp 12870 ...cfz 13379 seqcseq 13861 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2709 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7665 ax-cnex 11066 ax-resscn 11067 ax-1cn 11068 ax-icn 11069 ax-addcl 11070 ax-addrcl 11071 ax-mulcl 11072 ax-mulrcl 11073 ax-mulcom 11074 ax-addass 11075 ax-mulass 11076 ax-distr 11077 ax-i2m1 11078 ax-1ne0 11079 ax-1rid 11080 ax-rnegex 11081 ax-rrecex 11082 ax-cnre 11083 ax-pre-lttri 11084 ax-pre-lttrn 11085 ax-pre-ltadd 11086 ax-pre-mulgt0 11087 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-pss 3928 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-iun 4955 df-br 5105 df-opab 5167 df-mpt 5188 df-tr 5222 df-id 5530 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5587 df-we 5589 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 6252 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6446 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7308 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7796 df-1st 7914 df-2nd 7915 df-frecs 8205 df-wrecs 8236 df-recs 8310 df-rdg 8349 df-er 8607 df-en 8843 df-dom 8844 df-sdom 8845 df-pnf 11150 df-mnf 11151 df-xr 11152 df-ltxr 11153 df-le 11154 df-sub 11346 df-neg 11347 df-nn 12113 df-n0 12373 df-z 12459 df-uz 12723 df-rp 12871 df-fz 13380 df-fzo 13523 df-seq 13862 |
This theorem is referenced by: stoweidlem48 44184 |
Copyright terms: Public domain | W3C validator |