Metamath Proof Explorer


Theorem elovolmr

Description: Sufficient condition for elementhood in the set M . (Contributed by Mario Carneiro, 16-Mar-2014)

Ref Expression
Hypotheses elovolm.1 M = y * | f 2 A ran . f y = sup ran seq 1 + abs f * <
elovolmr.2 S = seq 1 + abs F
Assertion elovolmr F : 2 A ran . F sup ran S * < M

Proof

Step Hyp Ref Expression
1 elovolm.1 M = y * | f 2 A ran . f y = sup ran seq 1 + abs f * <
2 elovolmr.2 S = seq 1 + abs F
3 elovolmlem F 2 F : 2
4 id f = F f = F
5 4 eqcomd f = F F = f
6 5 coeq2d f = F abs F = abs f
7 6 seqeq3d f = F seq 1 + abs F = seq 1 + abs f
8 2 7 eqtrid f = F S = seq 1 + abs f
9 8 rneqd f = F ran S = ran seq 1 + abs f
10 9 supeq1d f = F sup ran S * < = sup ran seq 1 + abs f * <
11 10 biantrud f = F A ran . f A ran . f sup ran S * < = sup ran seq 1 + abs f * <
12 coeq2 f = F . f = . F
13 12 rneqd f = F ran . f = ran . F
14 13 unieqd f = F ran . f = ran . F
15 14 sseq2d f = F A ran . f A ran . F
16 11 15 bitr3d f = F A ran . f sup ran S * < = sup ran seq 1 + abs f * < A ran . F
17 16 rspcev F 2 A ran . F f 2 A ran . f sup ran S * < = sup ran seq 1 + abs f * <
18 3 17 sylanbr F : 2 A ran . F f 2 A ran . f sup ran S * < = sup ran seq 1 + abs f * <
19 1 elovolm sup ran S * < M f 2 A ran . f sup ran S * < = sup ran seq 1 + abs f * <
20 18 19 sylibr F : 2 A ran . F sup ran S * < M