Metamath Proof Explorer


Theorem onvfowev

Description: If F maps the ordinals onto the universe, then R well-orders the universe. This is the ZFC version of (8 -> 3) in https://tinyurl.com/hamkins-gblac . Note that in NBG set theory the antecedent would be something like A. X ( X =/= (/) -> E. F F : On -onto-> X ) , but since we cannot quantify over classes, we instead consider only the case X = _V which is sufficient for this proof. (Contributed by BTernaryTau, 12-Jun-2026)

Ref Expression
Hypotheses onvfowev.1 R = x y | H x H y
onvfowev.2 H = z V F -1 z
Assertion onvfowev F : On onto V R We V

Proof

Step Hyp Ref Expression
1 onvfowev.1 R = x y | H x H y
2 onvfowev.2 H = z V F -1 z
3 cnvimass F -1 z dom F
4 fofn F : On onto V F Fn On
5 4 fndmd F : On onto V dom F = On
6 3 5 sseqtrid F : On onto V F -1 z On
7 vex z V
8 forn F : On onto V ran F = V
9 7 8 eleqtrrid F : On onto V z ran F
10 inisegn0 z ran F F -1 z
11 9 10 sylib F : On onto V F -1 z
12 oninton F -1 z On F -1 z F -1 z On
13 6 11 12 syl2anc F : On onto V F -1 z On
14 13 adantr F : On onto V z V F -1 z On
15 14 2 fmptd F : On onto V H : V On
16 fofun F : On onto V Fun F
17 fvexd F : On onto V H v = H w H v V
18 vex w V
19 18 a1i F : On onto V w V
20 13 adantr F : On onto V z = w F -1 z On
21 sneq z = w z = w
22 21 imaeq2d z = w F -1 z = F -1 w
23 22 inteqd z = w F -1 z = F -1 w
24 23 adantl F : On onto V z = w F -1 z = F -1 w
25 19 20 24 fvmptdv2 F : On onto V H = z V F -1 z H w = F -1 w
26 2 25 mpi F : On onto V H w = F -1 w
27 cnvimass F -1 w dom F
28 27 5 sseqtrid F : On onto V F -1 w On
29 18 8 eleqtrrid F : On onto V w ran F
30 inisegn0 w ran F F -1 w
31 29 30 sylib F : On onto V F -1 w
32 onint F -1 w On F -1 w F -1 w F -1 w
33 28 31 32 syl2anc F : On onto V F -1 w F -1 w
34 26 33 eqeltrd F : On onto V H w F -1 w
35 eleq1 H v = H w H v F -1 w H w F -1 w
36 34 35 syl5ibrcom F : On onto V H v = H w H v F -1 w
37 vex v V
38 37 a1i F : On onto V v V
39 13 adantr F : On onto V z = v F -1 z On
40 sneq z = v z = v
41 40 imaeq2d z = v F -1 z = F -1 v
42 41 inteqd z = v F -1 z = F -1 v
43 42 adantl F : On onto V z = v F -1 z = F -1 v
44 38 39 43 fvmptdv2 F : On onto V H = z V F -1 z H v = F -1 v
45 2 44 mpi F : On onto V H v = F -1 v
46 cnvimass F -1 v dom F
47 46 5 sseqtrid F : On onto V F -1 v On
48 37 8 eleqtrrid F : On onto V v ran F
49 inisegn0 v ran F F -1 v
50 48 49 sylib F : On onto V F -1 v
51 onint F -1 v On F -1 v F -1 v F -1 v
52 47 50 51 syl2anc F : On onto V F -1 v F -1 v
53 45 52 eqeltrd F : On onto V H v F -1 v
54 36 53 jctild F : On onto V H v = H w H v F -1 v H v F -1 w
55 54 imp F : On onto V H v = H w H v F -1 v H v F -1 w
56 eleq1 u = H v u F -1 v H v F -1 v
57 eleq1 u = H v u F -1 w H v F -1 w
58 56 57 anbi12d u = H v u F -1 v u F -1 w H v F -1 v H v F -1 w
59 17 55 58 spcedv F : On onto V H v = H w u u F -1 v u F -1 w
60 59 ex F : On onto V H v = H w u u F -1 v u F -1 w
61 elinisegg v V u V u F -1 v u F v
62 61 el2v u F -1 v u F v
63 elinisegg w V u V u F -1 w u F w
64 63 el2v u F -1 w u F w
65 62 64 anbi12i u F -1 v u F -1 w u F v u F w
66 65 exbii u u F -1 v u F -1 w u u F v u F w
67 60 66 imbitrdi F : On onto V H v = H w u u F v u F w
68 funeu Fun F u F v ∃! v u F v
69 68 3adant3 Fun F u F v u F w ∃! v u F v
70 3simpc Fun F u F v u F w u F v u F w
71 breq2 v = w u F v u F w
72 71 eu4 ∃! v u F v v u F v v w u F v u F w v = w
73 72 simprbi ∃! v u F v v w u F v u F w v = w
74 73 19.21bbi ∃! v u F v u F v u F w v = w
75 69 70 74 sylc Fun F u F v u F w v = w
76 75 3expib Fun F u F v u F w v = w
77 76 exlimdv Fun F u u F v u F w v = w
78 16 67 77 sylsyld F : On onto V H v = H w v = w
79 78 ralrimivw F : On onto V w V H v = H w v = w
80 79 ralrimivw F : On onto V v V w V H v = H w v = w
81 dff13 H : V 1-1 On H : V On v V w V H v = H w v = w
82 15 80 81 sylanbrc F : On onto V H : V 1-1 On
83 1 vonf1wev H : V 1-1 On R We V
84 82 83 syl F : On onto V R We V