Metamath Proof Explorer


Theorem cfflb

Description: If there is a cofinal map from B to A , then B is at least ( cfA ) . This theorem and cff1 motivate the picture of ( cfA ) as the greatest lower bound of the domain of cofinal maps into A . (Contributed by Mario Carneiro, 28-Feb-2013)

Ref Expression
Assertion cfflb A On B On f f : B A z A w B z f w cf A B

Proof

Step Hyp Ref Expression
1 frn f : B A ran f A
2 1 adantr f : B A z A w B z f w ran f A
3 ffn f : B A f Fn B
4 fnfvelrn f Fn B w B f w ran f
5 3 4 sylan f : B A w B f w ran f
6 sseq2 s = f w z s z f w
7 6 rspcev f w ran f z f w s ran f z s
8 5 7 sylan f : B A w B z f w s ran f z s
9 8 rexlimdva2 f : B A w B z f w s ran f z s
10 9 ralimdv f : B A z A w B z f w z A s ran f z s
11 10 imp f : B A z A w B z f w z A s ran f z s
12 2 11 jca f : B A z A w B z f w ran f A z A s ran f z s
13 fvex card ran f V
14 cfval A On cf A = x | y x = card y y A z A s y z s
15 14 adantr A On B On cf A = x | y x = card y y A z A s y z s
16 15 3ad2ant2 x = card ran f A On B On ran f A z A s ran f z s cf A = x | y x = card y y A z A s y z s
17 vex f V
18 17 rnex ran f V
19 fveq2 y = ran f card y = card ran f
20 19 eqeq2d y = ran f x = card y x = card ran f
21 sseq1 y = ran f y A ran f A
22 rexeq y = ran f s y z s s ran f z s
23 22 ralbidv y = ran f z A s y z s z A s ran f z s
24 21 23 anbi12d y = ran f y A z A s y z s ran f A z A s ran f z s
25 20 24 anbi12d y = ran f x = card y y A z A s y z s x = card ran f ran f A z A s ran f z s
26 18 25 spcev x = card ran f ran f A z A s ran f z s y x = card y y A z A s y z s
27 abid x x | y x = card y y A z A s y z s y x = card y y A z A s y z s
28 26 27 sylibr x = card ran f ran f A z A s ran f z s x x | y x = card y y A z A s y z s
29 intss1 x x | y x = card y y A z A s y z s x | y x = card y y A z A s y z s x
30 28 29 syl x = card ran f ran f A z A s ran f z s x | y x = card y y A z A s y z s x
31 30 3adant2 x = card ran f A On B On ran f A z A s ran f z s x | y x = card y y A z A s y z s x
32 16 31 eqsstrd x = card ran f A On B On ran f A z A s ran f z s cf A x
33 32 3expib x = card ran f A On B On ran f A z A s ran f z s cf A x
34 sseq2 x = card ran f cf A x cf A card ran f
35 33 34 sylibd x = card ran f A On B On ran f A z A s ran f z s cf A card ran f
36 13 35 vtocle A On B On ran f A z A s ran f z s cf A card ran f
37 12 36 sylan2 A On B On f : B A z A w B z f w cf A card ran f
38 cardidm card card ran f = card ran f
39 onss A On A On
40 1 39 sylan9ssr A On f : B A ran f On
41 40 3adant2 A On B On f : B A ran f On
42 onssnum ran f V ran f On ran f dom card
43 18 41 42 sylancr A On B On f : B A ran f dom card
44 cardid2 ran f dom card card ran f ran f
45 43 44 syl A On B On f : B A card ran f ran f
46 onenon B On B dom card
47 dffn4 f Fn B f : B onto ran f
48 3 47 sylib f : B A f : B onto ran f
49 fodomnum B dom card f : B onto ran f ran f B
50 46 48 49 syl2im B On f : B A ran f B
51 50 imp B On f : B A ran f B
52 51 3adant1 A On B On f : B A ran f B
53 endomtr card ran f ran f ran f B card ran f B
54 45 52 53 syl2anc A On B On f : B A card ran f B
55 cardon card ran f On
56 onenon card ran f On card ran f dom card
57 55 56 ax-mp card ran f dom card
58 carddom2 card ran f dom card B dom card card card ran f card B card ran f B
59 57 46 58 sylancr B On card card ran f card B card ran f B
60 59 3ad2ant2 A On B On f : B A card card ran f card B card ran f B
61 54 60 mpbird A On B On f : B A card card ran f card B
62 cardonle B On card B B
63 62 3ad2ant2 A On B On f : B A card B B
64 61 63 sstrd A On B On f : B A card card ran f B
65 38 64 eqsstrrid A On B On f : B A card ran f B
66 65 3expa A On B On f : B A card ran f B
67 66 adantrr A On B On f : B A z A w B z f w card ran f B
68 37 67 sstrd A On B On f : B A z A w B z f w cf A B
69 68 ex A On B On f : B A z A w B z f w cf A B
70 69 exlimdv A On B On f f : B A z A w B z f w cf A B