Metamath Proof Explorer


Theorem ovolicc2

Description: The measure of a closed interval is upper bounded by its length. (Contributed by Mario Carneiro, 14-Jun-2014)

Ref Expression
Hypotheses ovolicc.1 φ A
ovolicc.2 φ B
ovolicc.3 φ A B
ovolicc2.m M = y * | f 2 A B ran . f y = sup ran seq 1 + abs f * <
Assertion ovolicc2 φ B A vol * A B

Proof

Step Hyp Ref Expression
1 ovolicc.1 φ A
2 ovolicc.2 φ B
3 ovolicc.3 φ A B
4 ovolicc2.m M = y * | f 2 A B ran . f y = sup ran seq 1 + abs f * <
5 4 elovolm z M f 2 A B ran . f z = sup ran seq 1 + abs f * <
6 simprr φ f 2 A B ran . f A B ran . f
7 unieq u = ran . f u = ran . f
8 7 sseq2d u = ran . f A B u A B ran . f
9 pweq u = ran . f 𝒫 u = 𝒫 ran . f
10 9 ineq1d u = ran . f 𝒫 u Fin = 𝒫 ran . f Fin
11 10 rexeqdv u = ran . f v 𝒫 u Fin A B v v 𝒫 ran . f Fin A B v
12 8 11 imbi12d u = ran . f A B u v 𝒫 u Fin A B v A B ran . f v 𝒫 ran . f Fin A B v
13 eqid topGen ran . = topGen ran .
14 eqid topGen ran . 𝑡 A B = topGen ran . 𝑡 A B
15 13 14 icccmp A B topGen ran . 𝑡 A B Comp
16 1 2 15 syl2anc φ topGen ran . 𝑡 A B Comp
17 retop topGen ran . Top
18 iccssre A B A B
19 1 2 18 syl2anc φ A B
20 uniretop = topGen ran .
21 20 cmpsub topGen ran . Top A B topGen ran . 𝑡 A B Comp u 𝒫 topGen ran . A B u v 𝒫 u Fin A B v
22 17 19 21 sylancr φ topGen ran . 𝑡 A B Comp u 𝒫 topGen ran . A B u v 𝒫 u Fin A B v
23 16 22 mpbid φ u 𝒫 topGen ran . A B u v 𝒫 u Fin A B v
24 23 adantr φ f 2 A B ran . f u 𝒫 topGen ran . A B u v 𝒫 u Fin A B v
25 ioof . : * × * 𝒫
26 ffn . : * × * 𝒫 . Fn * × *
27 25 26 ax-mp . Fn * × *
28 dffn3 . Fn * × * . : * × * ran .
29 27 28 mpbi . : * × * ran .
30 elovolmlem f 2 f : 2
31 30 bilani φ f 2 f : 2
32 inss2 2 2
33 rexpssxrxp 2 * × *
34 32 33 sstri 2 * × *
35 fss f : 2 2 * × * f : * × *
36 31 34 35 sylancl φ f 2 f : * × *
37 fco . : * × * ran . f : * × * . f : ran .
38 29 36 37 sylancr φ f 2 . f : ran .
39 38 adantrr φ f 2 A B ran . f . f : ran .
40 39 frnd φ f 2 A B ran . f ran . f ran .
41 retopbas ran . TopBases
42 bastg ran . TopBases ran . topGen ran .
43 41 42 ax-mp ran . topGen ran .
44 40 43 sstrdi φ f 2 A B ran . f ran . f topGen ran .
45 fvex topGen ran . V
46 45 elpw2 ran . f 𝒫 topGen ran . ran . f topGen ran .
47 44 46 sylibr φ f 2 A B ran . f ran . f 𝒫 topGen ran .
48 12 24 47 rspcdva φ f 2 A B ran . f A B ran . f v 𝒫 ran . f Fin A B v
49 6 48 mpd φ f 2 A B ran . f v 𝒫 ran . f Fin A B v
50 simprl φ f 2 v 𝒫 ran . f Fin A B v v 𝒫 ran . f Fin
51 elin v 𝒫 ran . f Fin v 𝒫 ran . f v Fin
52 50 51 sylib φ f 2 v 𝒫 ran . f Fin A B v v 𝒫 ran . f v Fin
53 52 simprd φ f 2 v 𝒫 ran . f Fin A B v v Fin
54 52 simpld φ f 2 v 𝒫 ran . f Fin A B v v 𝒫 ran . f
55 54 elpwid φ f 2 v 𝒫 ran . f Fin A B v v ran . f
56 55 sseld φ f 2 v 𝒫 ran . f Fin A B v t v t ran . f
57 38 ffnd φ f 2 . f Fn
58 57 adantr φ f 2 v 𝒫 ran . f Fin A B v . f Fn
59 fvelrnb . f Fn t ran . f k . f k = t
60 58 59 syl φ f 2 v 𝒫 ran . f Fin A B v t ran . f k . f k = t
61 56 60 sylibd φ f 2 v 𝒫 ran . f Fin A B v t v k . f k = t
62 61 ralrimiv φ f 2 v 𝒫 ran . f Fin A B v t v k . f k = t
63 fveqeq2 k = g t . f k = t . f g t = t
64 63 ac6sfi v Fin t v k . f k = t g g : v t v . f g t = t
65 53 62 64 syl2anc φ f 2 v 𝒫 ran . f Fin A B v g g : v t v . f g t = t
66 1 ad2antrr φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t A
67 2 ad2antrr φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t B
68 3 ad2antrr φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t A B
69 eqid seq 1 + abs f = seq 1 + abs f
70 31 adantr φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t f : 2
71 simprll φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t v 𝒫 ran . f Fin
72 simprlr φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t A B v
73 simprrl φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t g : v
74 simprrr φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t t v . f g t = t
75 2fveq3 t = x . f g t = . f g x
76 id t = x t = x
77 75 76 eqeq12d t = x . f g t = t . f g x = x
78 77 rspccva t v . f g t = t x v . f g x = x
79 74 78 sylan φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t x v . f g x = x
80 eqid u v | u A B = u v | u A B
81 66 67 68 69 70 71 72 73 79 80 ovolicc2lem5 φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t B A sup ran seq 1 + abs f * <
82 81 expr φ f 2 v 𝒫 ran . f Fin A B v g : v t v . f g t = t B A sup ran seq 1 + abs f * <
83 82 exlimdv φ f 2 v 𝒫 ran . f Fin A B v g g : v t v . f g t = t B A sup ran seq 1 + abs f * <
84 65 83 mpd φ f 2 v 𝒫 ran . f Fin A B v B A sup ran seq 1 + abs f * <
85 84 rexlimdvaa φ f 2 v 𝒫 ran . f Fin A B v B A sup ran seq 1 + abs f * <
86 85 adantrr φ f 2 A B ran . f v 𝒫 ran . f Fin A B v B A sup ran seq 1 + abs f * <
87 49 86 mpd φ f 2 A B ran . f B A sup ran seq 1 + abs f * <
88 breq2 z = sup ran seq 1 + abs f * < B A z B A sup ran seq 1 + abs f * <
89 87 88 syl5ibrcom φ f 2 A B ran . f z = sup ran seq 1 + abs f * < B A z
90 89 expr φ f 2 A B ran . f z = sup ran seq 1 + abs f * < B A z
91 90 impd φ f 2 A B ran . f z = sup ran seq 1 + abs f * < B A z
92 91 rexlimdva φ f 2 A B ran . f z = sup ran seq 1 + abs f * < B A z
93 5 92 biimtrid φ z M B A z
94 93 ralrimiv φ z M B A z
95 4 ssrab3 M *
96 2 1 resubcld φ B A
97 96 rexrd φ B A *
98 infxrgelb M * B A * B A inf M * < z M B A z
99 95 97 98 sylancr φ B A inf M * < z M B A z
100 94 99 mpbird φ B A inf M * <
101 4 ovolval A B vol * A B = inf M * <
102 19 101 syl φ vol * A B = inf M * <
103 100 102 breqtrrd φ B A vol * A B