Metamath Proof Explorer


Theorem mh-prprimbi

Description: Shortest possible version of ax-pr in primitive symbols. (Contributed by Matthew House, 13-Apr-2026)

Ref Expression
Assertion mh-prprimbi ⊢ ∃ z ∀ w w = x ∨ w = y → w ∈ z ↔ ¬ ∀ z x ∈ z → ¬ y ∈ z

Proof

Step Hyp Ref Expression
1 jaob ⊢ w = x ∨ w = y → w ∈ z ↔ w = x → w ∈ z ∧ w = y → w ∈ z
2 1 albii ⊢ ∀ w w = x ∨ w = y → w ∈ z ↔ ∀ w w = x → w ∈ z ∧ w = y → w ∈ z
3 19.26 ⊢ ∀ w w = x → w ∈ z ∧ w = y → w ∈ z ↔ ∀ w w = x → w ∈ z ∧ ∀ w w = y → w ∈ z
4 elequ1 ⊢ w = x → w ∈ z ↔ x ∈ z
5 4 equsalvw ⊢ ∀ w w = x → w ∈ z ↔ x ∈ z
6 elequ1 ⊢ w = y → w ∈ z ↔ y ∈ z
7 6 equsalvw ⊢ ∀ w w = y → w ∈ z ↔ y ∈ z
8 5 7 anbi12i ⊢ ∀ w w = x → w ∈ z ∧ ∀ w w = y → w ∈ z ↔ x ∈ z ∧ y ∈ z
9 2 3 8 3bitri ⊢ ∀ w w = x ∨ w = y → w ∈ z ↔ x ∈ z ∧ y ∈ z
10 9 exbii ⊢ ∃ z ∀ w w = x ∨ w = y → w ∈ z ↔ ∃ z x ∈ z ∧ y ∈ z
11 exnalimn ⊢ ∃ z x ∈ z ∧ y ∈ z ↔ ¬ ∀ z x ∈ z → ¬ y ∈ z
12 10 11 bitri ⊢ ∃ z ∀ w w = x ∨ w = y → w ∈ z ↔ ¬ ∀ z x ∈ z → ¬ y ∈ z