Metamath Proof Explorer


Theorem permaxpr

Description: The Axiom of Pairing ax-pr holds in permutation models. Part of Exercise II.9.2 of Kunen2 p. 148. (Contributed by Eric Schmidt, 6-Nov-2025)

Ref Expression
Hypotheses permmodel.1 ⊢ F : V ⟶ 1-1 onto V
permmodel.2 ⊢ R = F -1 ∘ E
Assertion permaxpr ⊢ ∃ z ∀ w w = x ∨ w = y → w R z

Proof

Step Hyp Ref Expression
1 permmodel.1 ⊢ F : V ⟶ 1-1 onto V
2 permmodel.2 ⊢ R = F -1 ∘ E
3 fvex ⊢ F -1 ⁡ x y ∈ V
4 breq2 ⊢ z = F -1 ⁡ x y → w R z ↔ w R F -1 ⁡ x y
5 4 imbi2d ⊢ z = F -1 ⁡ x y → w = x ∨ w = y → w R z ↔ w = x ∨ w = y → w R F -1 ⁡ x y
6 5 albidv ⊢ z = F -1 ⁡ x y → ∀ w w = x ∨ w = y → w R z ↔ ∀ w w = x ∨ w = y → w R F -1 ⁡ x y
7 vex ⊢ w ∈ V
8 prex ⊢ x y ∈ V
9 1 2 7 8 brpermmodelcnv ⊢ w R F -1 ⁡ x y ↔ w ∈ x y
10 7 elpr ⊢ w ∈ x y ↔ w = x ∨ w = y
11 9 10 sylbbr ⊢ w = x ∨ w = y → w R F -1 ⁡ x y
12 11 ax-gen ⊢ ∀ w w = x ∨ w = y → w R F -1 ⁡ x y
13 3 6 12 ceqsexv2d ⊢ ∃ z ∀ w w = x ∨ w = y → w R z