Theorem axregndlem1 10642

Description: Lemma for the Axiom of Regularity with no distinct variable conditions. Usage of this theorem is discouraged because it depends on ax-13 2377. (Contributed by NM, 3-Jan-2002.) (New usage is discouraged.)

Assertion

Ref	Expression
axregndlem1	⊢ (∀𝑥 𝑥 = 𝑧 → (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))

Proof of Theorem axregndlem1

Step	Hyp	Ref	Expression
1		19.8a 2181	. 2 ⊢ (𝑥 ∈ 𝑦 → ∃𝑥 𝑥 ∈ 𝑦)
2		nfae 2438	. . 3 ⊢ Ⅎ𝑥∀𝑥 𝑥 = 𝑧
3		nfae 2438	. . . . . 6 ⊢ Ⅎ𝑧∀𝑥 𝑥 = 𝑧
4		elirrv 9636	. . . . . . . . 9 ⊢ ¬ 𝑥 ∈ 𝑥
5		elequ1 2115	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝑥 ↔ 𝑧 ∈ 𝑥))
6	4, 5	mtbii 326	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → ¬ 𝑧 ∈ 𝑥)
7	6	sps 2185	. . . . . . 7 ⊢ (∀𝑥 𝑥 = 𝑧 → ¬ 𝑧 ∈ 𝑥)
8	7	pm2.21d 121	. . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑧 → (𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))
9	3, 8	alrimi 2213	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑧 → ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))
10	9	anim2i 617	. . . 4 ⊢ ((𝑥 ∈ 𝑦 ∧ ∀𝑥 𝑥 = 𝑧) → (𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦)))
11	10	expcom 413	. . 3 ⊢ (∀𝑥 𝑥 = 𝑧 → (𝑥 ∈ 𝑦 → (𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
12	2, 11	eximd 2216	. 2 ⊢ (∀𝑥 𝑥 = 𝑧 → (∃𝑥 𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
13	1, 12	syl5 34	1 ⊢ (∀𝑥 𝑥 = 𝑧 → (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395  ∀wal 1538  ∃wex 1779

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-13 2377  ax-ext 2708  ax-sep 5296  ax-pr 5432  ax-reg 9632

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3062  df-rex 3071  df-v 3482  df-un 3956  df-sn 4627  df-pr 4629

This theorem is referenced by:  axregndlem2  10643  axregnd  10644