Metamath Proof Explorer


Theorem vonf1onprcf1ac

Description: If F maps the universe one-to-one into the ordinals and A is a proper class, then I maps the ordinals one-to-one into A and the Axiom of Choice holds. This is the ZFC version of (6 -> 7) in https://tinyurl.com/hamkins-gblac . Note that in NBG set theory the first hypothesis would be something like ph -> A. X E. F F : X -1-1-> On , but since we cannot quantify over classes, we instead consider only the case X = _V which is sufficient for this proof. (Contributed by BTernaryTau, 22-Jun-2026)

Ref Expression
Hypotheses vonf1onprcf1ac.1 ⊢ φ → F : V ⟶ 1-1 On
vonf1onprcf1ac.2 ⊢ φ → ¬ A ∈ V
vonf1onprcf1ac.3 ⊢ I = F ↾ A -1 ∘ H
vonf1onprcf1ac.4 ⊢ H = OrdIso E F A
Assertion vonf1onprcf1ac ⊢ φ → I : On ⟶ 1-1 A ∧ CHOICE

Proof

Step Hyp Ref Expression
1 vonf1onprcf1ac.1 ⊢ φ → F : V ⟶ 1-1 On
2 vonf1onprcf1ac.2 ⊢ φ → ¬ A ∈ V
3 vonf1onprcf1ac.3 ⊢ I = F ↾ A -1 ∘ H
4 vonf1onprcf1ac.4 ⊢ H = OrdIso E F A
5 ssv ⊢ A ⊆ V
6 f1ores ⊢ F : V ⟶ 1-1 On ∧ A ⊆ V → F ↾ A : A ⟶ 1-1 onto F A
7 1 5 6 sylancl ⊢ φ → F ↾ A : A ⟶ 1-1 onto F A
8 f1ocnv ⊢ F ↾ A : A ⟶ 1-1 onto F A → F ↾ A -1 : F A ⟶ 1-1 onto A
9 7 8 syl ⊢ φ → F ↾ A -1 : F A ⟶ 1-1 onto A
10 f1f ⊢ F : V ⟶ 1-1 On → F : V ⟶ On
11 1 10 syl ⊢ φ → F : V ⟶ On
12 11 fimassd ⊢ φ → F A ⊆ On
13 f1preimaex ⊢ F : V ⟶ 1-1 On ∧ A ⊆ V ∧ F A ∈ V → A ∈ V
14 5 13 mp3an2 ⊢ F : V ⟶ 1-1 On ∧ F A ∈ V → A ∈ V
15 14 ex ⊢ F : V ⟶ 1-1 On → F A ∈ V → A ∈ V
16 1 15 syl ⊢ φ → F A ∈ V → A ∈ V
17 2 16 mtod ⊢ φ → ¬ F A ∈ V
18 epweon ⊢ E We On
19 wess ⊢ F A ⊆ On → E We On → E We F A
20 18 19 mpi ⊢ F A ⊆ On → E We F A
21 epse ⊢ E Se F A
22 4 ordtypeon ⊢ E We F A ∧ E Se F A ∧ ¬ F A ∈ V → H Isom E , E On F A
23 21 22 mp3an2 ⊢ E We F A ∧ ¬ F A ∈ V → H Isom E , E On F A
24 20 23 sylan ⊢ F A ⊆ On ∧ ¬ F A ∈ V → H Isom E , E On F A
25 12 17 24 syl2anc ⊢ φ → H Isom E , E On F A
26 isof1o ⊢ H Isom E , E On F A → H : On ⟶ 1-1 onto F A
27 25 26 syl ⊢ φ → H : On ⟶ 1-1 onto F A
28 f1oco ⊢ F ↾ A -1 : F A ⟶ 1-1 onto A ∧ H : On ⟶ 1-1 onto F A → F ↾ A -1 ∘ H : On ⟶ 1-1 onto A
29 9 27 28 syl2anc ⊢ φ → F ↾ A -1 ∘ H : On ⟶ 1-1 onto A
30 3 a1i ⊢ φ → I = F ↾ A -1 ∘ H
31 30 f1oeq1d ⊢ φ → I : On ⟶ 1-1 onto A ↔ F ↾ A -1 ∘ H : On ⟶ 1-1 onto A
32 29 31 mpbird ⊢ φ → I : On ⟶ 1-1 onto A
33 f1of1 ⊢ I : On ⟶ 1-1 onto A → I : On ⟶ 1-1 A
34 32 33 syl ⊢ φ → I : On ⟶ 1-1 A
35 eqid ⊢ x y | F ⁡ x ∈ F ⁡ y = x y | F ⁡ x ∈ F ⁡ y
36 35 vonf1wev ⊢ F : V ⟶ 1-1 On → x y | F ⁡ x ∈ F ⁡ y We V
37 ssv ⊢ z ⊆ V
38 wess ⊢ z ⊆ V → x y | F ⁡ x ∈ F ⁡ y We V → x y | F ⁡ x ∈ F ⁡ y We z
39 37 38 ax-mp ⊢ x y | F ⁡ x ∈ F ⁡ y We V → x y | F ⁡ x ∈ F ⁡ y We z
40 1 36 39 3syl ⊢ φ → x y | F ⁡ x ∈ F ⁡ y We z
41 weinxp ⊢ x y | F ⁡ x ∈ F ⁡ y We z ↔ x y | F ⁡ x ∈ F ⁡ y ∩ z × z We z
42 vex ⊢ z ∈ V
43 42 42 xpex ⊢ z × z ∈ V
44 43 inex2 ⊢ x y | F ⁡ x ∈ F ⁡ y ∩ z × z ∈ V
45 weeq1 ⊢ w = x y | F ⁡ x ∈ F ⁡ y ∩ z × z → w We z ↔ x y | F ⁡ x ∈ F ⁡ y ∩ z × z We z
46 44 45 spcev ⊢ x y | F ⁡ x ∈ F ⁡ y ∩ z × z We z → ∃ w w We z
47 41 46 sylbi ⊢ x y | F ⁡ x ∈ F ⁡ y We z → ∃ w w We z
48 40 47 syl ⊢ φ → ∃ w w We z
49 48 alrimiv ⊢ φ → ∀ z ∃ w w We z
50 dfac8 ⊢ CHOICE ↔ ∀ z ∃ w w We z
51 49 50 sylibr ⊢ φ → CHOICE
52 34 51 jca ⊢ φ → I : On ⟶ 1-1 A ∧ CHOICE