Theorem mh-infprim3bi 37087

Description: An axiom of infinity in primitive symbols not requiring ax-reg 9552. This version of the axiom was designed by Stefan O'Rear for his zf2.nql program, see https://github.com/sorear/metamath-turing-machines 9552. It directly implies ax-inf 9605, but deriving ax-inf2 9608 requires ax-ext 2734 and ax-rep 5237, see mh-inf3sn 37081. (Contributed by Matthew House, 13-Apr-2026.)

Assertion

Ref	Expression
mh-infprim3bi	⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 {𝑧} ∈ 𝑦) ↔ ¬ ∀𝑦 ¬ ¬ (𝑥 ∈ 𝑦 → ¬ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))))

Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem mh-infprim3bi

Step	Hyp	Ref	Expression
1		sneq 4598	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → {𝑧} = {𝑥})
2	1	eleq1d 2847	. . . . . . 7 ⊢ (𝑧 = 𝑥 → ({𝑧} ∈ 𝑦 ↔ {𝑥} ∈ 𝑦))
3	2	cbvralvw 3242	. . . . . 6 ⊢ (∀𝑧 ∈ 𝑦 {𝑧} ∈ 𝑦 ↔ ∀𝑥 ∈ 𝑦 {𝑥} ∈ 𝑦)
4		dfclel 2838	. . . . . . . 8 ⊢ ({𝑥} ∈ 𝑦 ↔ ∃𝑧(𝑧 = {𝑥} ∧ 𝑧 ∈ 𝑦))
5		dfcleq 2755	. . . . . . . . . . . 12 ⊢ (𝑧 = {𝑥} ↔ ∀𝑦(𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑥}))
6		velsn 4604	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
7	6	bibi2i 340	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑥}) ↔ (𝑦 ∈ 𝑧 ↔ 𝑦 = 𝑥))
8		dfbi1 216	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝑧 ↔ 𝑦 = 𝑥) ↔ ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧)))
9	7, 8	bitri 278	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑥}) ↔ ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧)))
10	9	albii 1848	. . . . . . . . . . . 12 ⊢ (∀𝑦(𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑥}) ↔ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧)))
11	5, 10	bitri 278	. . . . . . . . . . 11 ⊢ (𝑧 = {𝑥} ↔ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧)))
12	11	anbi2ci 636	. . . . . . . . . 10 ⊢ ((𝑧 = {𝑥} ∧ 𝑧 ∈ 𝑦) ↔ (𝑧 ∈ 𝑦 ∧ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))
13		df-an 401	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑦 ∧ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))) ↔ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))
14	12, 13	bitri 278	. . . . . . . . 9 ⊢ ((𝑧 = {𝑥} ∧ 𝑧 ∈ 𝑦) ↔ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))
15	14	exbii 1877	. . . . . . . 8 ⊢ (∃𝑧(𝑧 = {𝑥} ∧ 𝑧 ∈ 𝑦) ↔ ∃𝑧 ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))
16		df-ex 1809	. . . . . . . 8 ⊢ (∃𝑧 ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))) ↔ ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))
17	4, 15, 16	3bitri 300	. . . . . . 7 ⊢ ({𝑥} ∈ 𝑦 ↔ ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))
18	17	ralbii 3110	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑦 {𝑥} ∈ 𝑦 ↔ ∀𝑥 ∈ 𝑦 ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))
19		df-ral 3079	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑦 ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))) ↔ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧)))))
20	3, 18, 19	3bitri 300	. . . . 5 ⊢ (∀𝑧 ∈ 𝑦 {𝑧} ∈ 𝑦 ↔ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧)))))
21	20	anbi2i 634	. . . 4 ⊢ ((𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 {𝑧} ∈ 𝑦) ↔ (𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))))
22		df-an 401	. . . 4 ⊢ ((𝑥 ∈ 𝑦 ∧ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))) ↔ ¬ (𝑥 ∈ 𝑦 → ¬ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))))
23	21, 22	bitri 278	. . 3 ⊢ ((𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 {𝑧} ∈ 𝑦) ↔ ¬ (𝑥 ∈ 𝑦 → ¬ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))))
24	23	exbii 1877	. 2 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 {𝑧} ∈ 𝑦) ↔ ∃𝑦 ¬ (𝑥 ∈ 𝑦 → ¬ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))))
25		df-ex 1809	. 2 ⊢ (∃𝑦 ¬ (𝑥 ∈ 𝑦 → ¬ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))) ↔ ¬ ∀𝑦 ¬ ¬ (𝑥 ∈ 𝑦 → ¬ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))))
26	24, 25	bitri 278	1 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 {𝑧} ∈ 𝑦) ↔ ¬ ∀𝑦 ¬ ¬ (𝑥 ∈ 𝑦 → ¬ ∀𝑥(𝑥 ∈ 𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧 ∈ 𝑦 → ¬ ∀𝑦 ¬ ((𝑦 ∈ 𝑧 → 𝑦 = 𝑥) → ¬ (𝑦 = 𝑥 → 𝑦 ∈ 𝑧))))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1567   = wceq 1569  ∃wex 1808   ∈ wcel 2142  ∀wral 3078  {csn 4588

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-v 3456  df-sn 4589

This theorem is used by: (None)