Theorem mh-inf3sn 37508

Description: Version of inf3 9663 for the set of Zermelo ordinals ∅, {∅}, {{∅}}, {{{∅}}}, etc., where the successor of 𝑦 is {𝑦}. Unlike inf3 9663, the proof does not require ax-reg 9613, since the singleton properties snnz 4737 and sneqr 4798 are sufficient to guarantee that all elements of the sequence are distinct. (Contributed by Matthew House, 13-Apr-2026.)

Hypothesis

Ref	Expression
mh-inf3sn.1	⊢ ∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥)

Assertion

Ref	Expression
mh-inf3sn	⊢ ω ∈ V

Distinct variable group:   𝑥,𝑦

Proof of Theorem mh-inf3sn

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 490	. . . . 5 ⊢ ((∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥) → ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥)
2		vex 3458	. . . . . . 7 ⊢ 𝑦 ∈ V
3	2	sneqr 4798	. . . . . 6 ⊢ ({𝑦} = {𝑧} → 𝑦 = 𝑧)
4	3	rgen2w 3085	. . . . 5 ⊢ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ({𝑦} = {𝑧} → 𝑦 = 𝑧)
5		eqid 2763	. . . . . 6 ⊢ (𝑦 ∈ 𝑥 ↦ {𝑦}) = (𝑦 ∈ 𝑥 ↦ {𝑦})
6		sneq 4594	. . . . . 6 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
7	5, 6	f1mpt 7288	. . . . 5 ⊢ ((𝑦 ∈ 𝑥 ↦ {𝑦}):𝑥⟶1-1𝑥 ↔ (∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ({𝑦} = {𝑧} → 𝑦 = 𝑧)))
8	1, 4, 7	sylanblrc 602	. . . 4 ⊢ ((∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥) → (𝑦 ∈ 𝑥 ↦ {𝑦}):𝑥⟶1-1𝑥)
9		simpl 488	. . . . 5 ⊢ ((∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥) → ∅ ∈ 𝑥)
10		snnzg 4735	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝑥 → {𝑦} ≠ ∅)
11	10	necomd 3014	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝑥 → ∅ ≠ {𝑦})
12	11	neneqd 2964	. . . . . . . 8 ⊢ (𝑦 ∈ 𝑥 → ¬ ∅ = {𝑦})
13	12	nrex 3094	. . . . . . 7 ⊢ ¬ ∃𝑦 ∈ 𝑥 ∅ = {𝑦}
14		vsnex 5397	. . . . . . . 8 ⊢ {𝑦} ∈ V
15	5, 14	elrnmpti 5951	. . . . . . 7 ⊢ (∅ ∈ ran (𝑦 ∈ 𝑥 ↦ {𝑦}) ↔ ∃𝑦 ∈ 𝑥 ∅ = {𝑦})
16	13, 15	mtbir 326	. . . . . 6 ⊢ ¬ ∅ ∈ ran (𝑦 ∈ 𝑥 ↦ {𝑦})
17	16	a1i 11	. . . . 5 ⊢ ((∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥) → ¬ ∅ ∈ ran (𝑦 ∈ 𝑥 ↦ {𝑦}))
18	9, 17	eldifd 4053	. . . 4 ⊢ ((∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥) → ∅ ∈ (𝑥 ∖ ran (𝑦 ∈ 𝑥 ↦ {𝑦})))
19	8, 18	mh-inf3f1 37507	. . 3 ⊢ ((∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥) → (rec((𝑦 ∈ 𝑥 ↦ {𝑦}), ∅) ↾ ω):ω⟶1-1𝑥)
20		vex 3458	. . 3 ⊢ 𝑥 ∈ V
21		f1dmex 7993	. . 3 ⊢ (((rec((𝑦 ∈ 𝑥 ↦ {𝑦}), ∅) ↾ ω):ω⟶1-1𝑥 ∧ 𝑥 ∈ V) → ω ∈ V)
22	19, 20, 21	sylancl 598	. 2 ⊢ ((∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥) → ω ∈ V)
23		mh-inf3sn.1	. 2 ⊢ ∃𝑥(∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {𝑦} ∈ 𝑥)
24	22, 23	exlimiiv 1966	1 ⊢ ω ∈ V

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454  ∅c0 4281  {csn 4588   ↦ cmpt 5189  ran crn 5656   ↾ cres 5657  ⟶1-1wf1 6555  ωcom 7901  reccrdg 8445

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446

This theorem is used by: (None)