Theorem mh-regprimbi 37333

Description: Shortest possible version of ax-reg 9586 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.)

Assertion

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

Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem mh-regprimbi

Step	Hyp	Ref	Expression
1		elequ1 2151	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦 ∈ 𝑥 ↔ 𝑧 ∈ 𝑥))
2	1	cbvexvw 2069	. . . 4 ⊢ (∃𝑦 𝑦 ∈ 𝑥 ↔ ∃𝑧 𝑧 ∈ 𝑥)
3		df-ex 1812	. . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝑥 ↔ ¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥)
4	2, 3	bitri 278	. . 3 ⊢ (∃𝑦 𝑦 ∈ 𝑥 ↔ ¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥)
5	4	imbi1i 352	. 2 ⊢ ((∃𝑦 𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) ↔ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))))
6		jarl 126	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) → (¬ 𝑦 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑥))
7	6	com12 33	. . . . . . . . . 10 ⊢ (¬ 𝑦 ∈ 𝑥 → (((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) → ¬ 𝑧 ∈ 𝑥))
8	7	alimdv 1948	. . . . . . . . 9 ⊢ (¬ 𝑦 ∈ 𝑥 → (∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) → ∀𝑧 ¬ 𝑧 ∈ 𝑥))
9	8	con3rr3 156	. . . . . . . 8 ⊢ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → (¬ 𝑦 ∈ 𝑥 → ¬ ∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)))
10	9	con4d 116	. . . . . . 7 ⊢ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → (∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) → 𝑦 ∈ 𝑥))
11	10	pm4.71rd 572	. . . . . 6 ⊢ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → (∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) ↔ (𝑦 ∈ 𝑥 ∧ ∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))))
12		pm5.5 364	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝑥 → ((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) ↔ 𝑧 ∈ 𝑦))
13	12	imbi1d 344	. . . . . . . 8 ⊢ (𝑦 ∈ 𝑥 → (((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) ↔ (𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥)))
14	13	albidv 1952	. . . . . . 7 ⊢ (𝑦 ∈ 𝑥 → (∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) ↔ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥)))
15	14	pm5.32i 585	. . . . . 6 ⊢ ((𝑦 ∈ 𝑥 ∧ ∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)) ↔ (𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥)))
16	11, 15	bitr2di 291	. . . . 5 ⊢ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ((𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥)) ↔ ∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)))
17	16	exbidv 1953	. . . 4 ⊢ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → (∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥)) ↔ ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)))
18	17	pm5.74i 274	. . 3 ⊢ ((¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) ↔ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)))
19		ala1 1845	. . . . . 6 ⊢ (∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))
20	19	alrimiv 1959	. . . . 5 ⊢ (∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∀𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))
21	20	19.2d 2009	. . . 4 ⊢ (∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))
22	21	biantrur 540	. . 3 ⊢ ((¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)) ↔ ((∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)) ∧ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))))
23		pm4.83 1042	. . 3 ⊢ (((∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥)) ∧ (¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))) ↔ ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))
24	18, 22, 23	3bitri 300	. 2 ⊢ ((¬ ∀𝑧 ¬ 𝑧 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) ↔ ∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))
25		df-ex 1812	. 2 ⊢ (∃𝑦∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥) ↔ ¬ ∀𝑦 ¬ ∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))
26	5, 24, 25	3bitri 300	1 ⊢ ((∃𝑦 𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) ↔ ¬ ∀𝑦 ¬ ∀𝑧((𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ¬ 𝑧 ∈ 𝑥))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812

This theorem is used by: (None)