Metamath Proof Explorer


Theorem mh-regprimbi

Description: Shortest possible version of ax-reg in primitive symbols. The equivalence is nontrivial, but it still follows solely from the axioms of predicate calculus. (Contributed by Matthew House, 13-Apr-2026)

Ref Expression
Assertion mh-regprimbi ( ( ∃ 𝑦 𝑦𝑥 → ∃ 𝑦 ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ) ↔ ¬ ∀ 𝑦 ¬ ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )

Proof

Step Hyp Ref Expression
1 elequ1 ( 𝑦 = 𝑧 → ( 𝑦𝑥𝑧𝑥 ) )
2 1 cbvexvw ( ∃ 𝑦 𝑦𝑥 ↔ ∃ 𝑧 𝑧𝑥 )
3 df-ex ( ∃ 𝑧 𝑧𝑥 ↔ ¬ ∀ 𝑧 ¬ 𝑧𝑥 )
4 2 3 bitri ( ∃ 𝑦 𝑦𝑥 ↔ ¬ ∀ 𝑧 ¬ 𝑧𝑥 )
5 4 imbi1i ( ( ∃ 𝑦 𝑦𝑥 → ∃ 𝑦 ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ) ↔ ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦 ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ) )
6 jarl ( ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) → ( ¬ 𝑦𝑥 → ¬ 𝑧𝑥 ) )
7 6 com12 ( ¬ 𝑦𝑥 → ( ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) → ¬ 𝑧𝑥 ) )
8 7 alimdv ( ¬ 𝑦𝑥 → ( ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) → ∀ 𝑧 ¬ 𝑧𝑥 ) )
9 8 con3rr3 ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ( ¬ 𝑦𝑥 → ¬ ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) )
10 9 con4d ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ( ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) → 𝑦𝑥 ) )
11 10 pm4.71rd ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ( ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ↔ ( 𝑦𝑥 ∧ ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) ) )
12 pm5.5 ( 𝑦𝑥 → ( ( 𝑦𝑥𝑧𝑦 ) ↔ 𝑧𝑦 ) )
13 12 imbi1d ( 𝑦𝑥 → ( ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ↔ ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) )
14 13 albidv ( 𝑦𝑥 → ( ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ↔ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) )
15 14 pm5.32i ( ( 𝑦𝑥 ∧ ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) ↔ ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) )
16 11 15 bitr2di ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ( ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ↔ ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) )
17 16 exbidv ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ( ∃ 𝑦 ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ↔ ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) )
18 17 pm5.74i ( ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦 ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ) ↔ ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) )
19 ala1 ( ∀ 𝑧 ¬ 𝑧𝑥 → ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )
20 19 alrimiv ( ∀ 𝑧 ¬ 𝑧𝑥 → ∀ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )
21 20 19.2d ( ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )
22 21 biantrur ( ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) ↔ ( ( ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) ∧ ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) ) )
23 pm4.83 ( ( ( ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) ∧ ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ) ) ↔ ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )
24 18 22 23 3bitri ( ( ¬ ∀ 𝑧 ¬ 𝑧𝑥 → ∃ 𝑦 ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ) ↔ ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )
25 df-ex ( ∃ 𝑦𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) ↔ ¬ ∀ 𝑦 ¬ ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )
26 5 24 25 3bitri ( ( ∃ 𝑦 𝑦𝑥 → ∃ 𝑦 ( 𝑦𝑥 ∧ ∀ 𝑧 ( 𝑧𝑦 → ¬ 𝑧𝑥 ) ) ) ↔ ¬ ∀ 𝑦 ¬ ∀ 𝑧 ( ( 𝑦𝑥𝑧𝑦 ) → ¬ 𝑧𝑥 ) )