Users' Mathboxes Mathbox for Matthew House < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mh-infprim3bi Structured version   Visualization version   GIF version

Theorem mh-infprim3bi 36746
Description: An axiom of infinity in primitive symbols not requiring ax-reg 9500. This version of the axiom was designed by Stefan O'Rear for his zf2.nql program, see https://github.com/sorear/metamath-turing-machines 9500. It directly implies ax-inf 9550, but deriving ax-inf2 9553 requires ax-ext 2709 and ax-rep 5212, see mh-inf3sn 36740. (Contributed by Matthew House, 13-Apr-2026.)
Assertion
Ref Expression
mh-infprim3bi (∃𝑦(𝑥𝑦 ∧ ∀𝑧𝑦 {𝑧} ∈ 𝑦) ↔ ¬ ∀𝑦 ¬ ¬ (𝑥𝑦 → ¬ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))))
Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem mh-infprim3bi
StepHypRef Expression
1 sneq 4578 . . . . . . . 8 (𝑧 = 𝑥 → {𝑧} = {𝑥})
21eleq1d 2822 . . . . . . 7 (𝑧 = 𝑥 → ({𝑧} ∈ 𝑦 ↔ {𝑥} ∈ 𝑦))
32cbvralvw 3216 . . . . . 6 (∀𝑧𝑦 {𝑧} ∈ 𝑦 ↔ ∀𝑥𝑦 {𝑥} ∈ 𝑦)
4 dfclel 2813 . . . . . . . 8 ({𝑥} ∈ 𝑦 ↔ ∃𝑧(𝑧 = {𝑥} ∧ 𝑧𝑦))
5 dfcleq 2730 . . . . . . . . . . . 12 (𝑧 = {𝑥} ↔ ∀𝑦(𝑦𝑧𝑦 ∈ {𝑥}))
6 velsn 4584 . . . . . . . . . . . . . . 15 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
76bibi2i 337 . . . . . . . . . . . . . 14 ((𝑦𝑧𝑦 ∈ {𝑥}) ↔ (𝑦𝑧𝑦 = 𝑥))
8 dfbi1 213 . . . . . . . . . . . . . 14 ((𝑦𝑧𝑦 = 𝑥) ↔ ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧)))
97, 8bitri 275 . . . . . . . . . . . . 13 ((𝑦𝑧𝑦 ∈ {𝑥}) ↔ ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧)))
109albii 1821 . . . . . . . . . . . 12 (∀𝑦(𝑦𝑧𝑦 ∈ {𝑥}) ↔ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧)))
115, 10bitri 275 . . . . . . . . . . 11 (𝑧 = {𝑥} ↔ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧)))
1211anbi2ci 626 . . . . . . . . . 10 ((𝑧 = {𝑥} ∧ 𝑧𝑦) ↔ (𝑧𝑦 ∧ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))
13 df-an 396 . . . . . . . . . 10 ((𝑧𝑦 ∧ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))) ↔ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))
1412, 13bitri 275 . . . . . . . . 9 ((𝑧 = {𝑥} ∧ 𝑧𝑦) ↔ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))
1514exbii 1850 . . . . . . . 8 (∃𝑧(𝑧 = {𝑥} ∧ 𝑧𝑦) ↔ ∃𝑧 ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))
16 df-ex 1782 . . . . . . . 8 (∃𝑧 ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))) ↔ ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))
174, 15, 163bitri 297 . . . . . . 7 ({𝑥} ∈ 𝑦 ↔ ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))
1817ralbii 3084 . . . . . 6 (∀𝑥𝑦 {𝑥} ∈ 𝑦 ↔ ∀𝑥𝑦 ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))
19 df-ral 3053 . . . . . 6 (∀𝑥𝑦 ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))) ↔ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧)))))
203, 18, 193bitri 297 . . . . 5 (∀𝑧𝑦 {𝑧} ∈ 𝑦 ↔ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧)))))
2120anbi2i 624 . . . 4 ((𝑥𝑦 ∧ ∀𝑧𝑦 {𝑧} ∈ 𝑦) ↔ (𝑥𝑦 ∧ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))))
22 df-an 396 . . . 4 ((𝑥𝑦 ∧ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))) ↔ ¬ (𝑥𝑦 → ¬ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))))
2321, 22bitri 275 . . 3 ((𝑥𝑦 ∧ ∀𝑧𝑦 {𝑧} ∈ 𝑦) ↔ ¬ (𝑥𝑦 → ¬ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))))
2423exbii 1850 . 2 (∃𝑦(𝑥𝑦 ∧ ∀𝑧𝑦 {𝑧} ∈ 𝑦) ↔ ∃𝑦 ¬ (𝑥𝑦 → ¬ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))))
25 df-ex 1782 . 2 (∃𝑦 ¬ (𝑥𝑦 → ¬ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))) ↔ ¬ ∀𝑦 ¬ ¬ (𝑥𝑦 → ¬ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))))
2624, 25bitri 275 1 (∃𝑦(𝑥𝑦 ∧ ∀𝑧𝑦 {𝑧} ∈ 𝑦) ↔ ¬ ∀𝑦 ¬ ¬ (𝑥𝑦 → ¬ ∀𝑥(𝑥𝑦 → ¬ ∀𝑧 ¬ ¬ (𝑧𝑦 → ¬ ∀𝑦 ¬ ((𝑦𝑧𝑦 = 𝑥) → ¬ (𝑦 = 𝑥𝑦𝑧))))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1540   = wceq 1542  wex 1781  wcel 2114  wral 3052  {csn 4568
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-v 3432  df-sn 4569
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator