Theorem axregnd 10719

Description: A version of the Axiom of Regularity with no distinct variable conditions. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by NM, 3-Jan-2002.) (Proof shortened by Wolf Lammen, 18-Aug-2019.) (New usage is discouraged.)

Assertion

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

Proof of Theorem axregnd

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		axregndlem2 10718	. . . 4 ⊢ (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑤(𝑤 ∈ 𝑥 → ¬ 𝑤 ∈ 𝑦)))
2		nfnae 2466	. . . . . 6 ⊢ Ⅎ𝑥 ¬ ∀𝑧 𝑧 = 𝑥
3		nfnae 2466	. . . . . 6 ⊢ Ⅎ𝑥 ¬ ∀𝑧 𝑧 = 𝑦
4	2, 3	nfan 1934	. . . . 5 ⊢ Ⅎ𝑥(¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦)
5		nfnae 2466	. . . . . . . 8 ⊢ Ⅎ𝑧 ¬ ∀𝑧 𝑧 = 𝑥
6		nfnae 2466	. . . . . . . 8 ⊢ Ⅎ𝑧 ¬ ∀𝑧 𝑧 = 𝑦
7	5, 6	nfan 1934	. . . . . . 7 ⊢ Ⅎ𝑧(¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦)
8		nfcvf 2952	. . . . . . . . . 10 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → Ⅎ𝑧𝑥)
9	8	nfcrd 2920	. . . . . . . . 9 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → Ⅎ𝑧 𝑤 ∈ 𝑥)
10	9	adantr 486	. . . . . . . 8 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧 𝑤 ∈ 𝑥)
11		nfcvf 2952	. . . . . . . . . . 11 ⊢ (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧𝑦)
12	11	nfcrd 2920	. . . . . . . . . 10 ⊢ (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧 𝑤 ∈ 𝑦)
13	12	nfnd 1891	. . . . . . . . 9 ⊢ (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧 ¬ 𝑤 ∈ 𝑦)
14	13	adantl 487	. . . . . . . 8 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧 ¬ 𝑤 ∈ 𝑦)
15	10, 14	nfimd 1929	. . . . . . 7 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧(𝑤 ∈ 𝑥 → ¬ 𝑤 ∈ 𝑦))
16		elequ1 2154	. . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (𝑤 ∈ 𝑥 ↔ 𝑧 ∈ 𝑥))
17		elequ1 2154	. . . . . . . . . 10 ⊢ (𝑤 = 𝑧 → (𝑤 ∈ 𝑦 ↔ 𝑧 ∈ 𝑦))
18	17	notbid 321	. . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (¬ 𝑤 ∈ 𝑦 ↔ ¬ 𝑧 ∈ 𝑦))
19	16, 18	imbi12d 347	. . . . . . . 8 ⊢ (𝑤 = 𝑧 → ((𝑤 ∈ 𝑥 → ¬ 𝑤 ∈ 𝑦) ↔ (𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦)))
20	19	a1i 11	. . . . . . 7 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑤 = 𝑧 → ((𝑤 ∈ 𝑥 → ¬ 𝑤 ∈ 𝑦) ↔ (𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
21	7, 15, 20	cbvald 2439	. . . . . 6 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (∀𝑤(𝑤 ∈ 𝑥 → ¬ 𝑤 ∈ 𝑦) ↔ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦)))
22	21	anbi2d 642	. . . . 5 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → ((𝑥 ∈ 𝑦 ∧ ∀𝑤(𝑤 ∈ 𝑥 → ¬ 𝑤 ∈ 𝑦)) ↔ (𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
23	4, 22	exbid 2263	. . . 4 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑤(𝑤 ∈ 𝑥 → ¬ 𝑤 ∈ 𝑦)) ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
24	1, 23	imbitrid 247	. . 3 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
25	24	ex 418	. 2 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦)))))
26		axregndlem1 10717	. . 3 ⊢ (∀𝑥 𝑥 = 𝑧 → (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
27	26	aecoms 2460	. 2 ⊢ (∀𝑧 𝑧 = 𝑥 → (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
28		19.8a 2221	. . 3 ⊢ (𝑥 ∈ 𝑦 → ∃𝑥 𝑥 ∈ 𝑦)
29		nfae 2465	. . . 4 ⊢ Ⅎ𝑥∀𝑧 𝑧 = 𝑦
30		elirrv 9621	. . . . . . . . 9 ⊢ ¬ 𝑧 ∈ 𝑧
31		elequ2 2162	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝑧 ↔ 𝑧 ∈ 𝑦))
32	30, 31	mtbii 329	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ¬ 𝑧 ∈ 𝑦)
33	32	a1d 26	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))
34	33	alimi 1844	. . . . . 6 ⊢ (∀𝑧 𝑧 = 𝑦 → ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))
35	34	anim2i 629	. . . . 5 ⊢ ((𝑥 ∈ 𝑦 ∧ ∀𝑧 𝑧 = 𝑦) → (𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦)))
36	35	expcom 419	. . . 4 ⊢ (∀𝑧 𝑧 = 𝑦 → (𝑥 ∈ 𝑦 → (𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
37	29, 36	eximd 2256	. . 3 ⊢ (∀𝑧 𝑧 = 𝑦 → (∃𝑥 𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
38	28, 37	syl5 35	. 2 ⊢ (∀𝑧 𝑧 = 𝑦 → (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦))))
39	25, 27, 38	pm2.61ii 185	1 ⊢ (𝑥 ∈ 𝑦 → ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑧(𝑧 ∈ 𝑥 → ¬ 𝑧 ∈ 𝑦)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816

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-13 2404  ax-ext 2735  ax-sep 5253  ax-reg 9616

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2755  df-clel 2839  df-nfc 2913

This theorem is used by:  zfcndreg  10732  axregprim  36661