Theorem axpowndlem4 10609

Description: Lemma for the Axiom of Power Sets with no distinct variable conditions. Usage of this theorem is discouraged because it depends on ax-13 2401. (Contributed by NM, 4-Jan-2002.) (Proof shortened by Mario Carneiro, 10-Dec-2016.) (New usage is discouraged.)

Assertion

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

Proof of Theorem axpowndlem4

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		axpowndlem3 10608	. . . . 5 ⊢ (¬ 𝑥 = 𝑤 → ∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥))
2	1	ax-gen 1828	. . . 4 ⊢ ∀𝑤(¬ 𝑥 = 𝑤 → ∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥))
3		nfnae 2463	. . . . . 6 ⊢ Ⅎ𝑦 ¬ ∀𝑦 𝑦 = 𝑥
4		nfnae 2463	. . . . . 6 ⊢ Ⅎ𝑦 ¬ ∀𝑦 𝑦 = 𝑧
5	3, 4	nfan 1932	. . . . 5 ⊢ Ⅎ𝑦(¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧)
6		nfcvf 2948	. . . . . . . . 9 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝑥)
7	6	adantr 486	. . . . . . . 8 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦𝑥)
8		nfcvd 2923	. . . . . . . 8 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦𝑤)
9	7, 8	nfeqd 2932	. . . . . . 7 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦 𝑥 = 𝑤)
10	9	nfnd 1891	. . . . . 6 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦 ¬ 𝑥 = 𝑤)
11		nfnae 2463	. . . . . . . 8 ⊢ Ⅎ𝑥 ¬ ∀𝑦 𝑦 = 𝑥
12		nfnae 2463	. . . . . . . 8 ⊢ Ⅎ𝑥 ¬ ∀𝑦 𝑦 = 𝑧
13	11, 12	nfan 1932	. . . . . . 7 ⊢ Ⅎ𝑥(¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧)
14		nfv 1947	. . . . . . . 8 ⊢ Ⅎ𝑤(¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧)
15		nfnae 2463	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑧 ¬ ∀𝑦 𝑦 = 𝑥
16		nfnae 2463	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑧 ¬ ∀𝑦 𝑦 = 𝑧
17	15, 16	nfan 1932	. . . . . . . . . . . 12 ⊢ Ⅎ𝑧(¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧)
18	7, 8	nfeld 2933	. . . . . . . . . . . 12 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦 𝑥 ∈ 𝑤)
19	17, 18	nfexd 2359	. . . . . . . . . . 11 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦∃𝑧 𝑥 ∈ 𝑤)
20		nfcvf 2948	. . . . . . . . . . . . . 14 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦𝑧)
21	20	adantl 487	. . . . . . . . . . . . 13 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦𝑧)
22	7, 21	nfeld 2933	. . . . . . . . . . . 12 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦 𝑥 ∈ 𝑧)
23	14, 22	nfald 2358	. . . . . . . . . . 11 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦∀𝑤 𝑥 ∈ 𝑧)
24	19, 23	nfimd 1927	. . . . . . . . . 10 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧))
25	13, 24	nfald 2358	. . . . . . . . 9 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧))
26	8, 7	nfeld 2933	. . . . . . . . 9 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦 𝑤 ∈ 𝑥)
27	25, 26	nfimd 1927	. . . . . . . 8 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥))
28	14, 27	nfald 2358	. . . . . . 7 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥))
29	13, 28	nfexd 2359	. . . . . 6 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥))
30	10, 29	nfimd 1927	. . . . 5 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑦(¬ 𝑥 = 𝑤 → ∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥)))
31		equequ2 2059	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝑥 = 𝑤 ↔ 𝑥 = 𝑦))
32	31	notbid 321	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → (¬ 𝑥 = 𝑤 ↔ ¬ 𝑥 = 𝑦))
33	32	adantl 487	. . . . . . 7 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → (¬ 𝑥 = 𝑤 ↔ ¬ 𝑥 = 𝑦))
34		nfcvd 2923	. . . . . . . . . . . . . . 15 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑥𝑤)
35		nfcvf2 2949	. . . . . . . . . . . . . . . 16 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑥𝑦)
36	35	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑥𝑦)
37	34, 36	nfeqd 2932	. . . . . . . . . . . . . 14 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑥 𝑤 = 𝑦)
38	13, 37	nfan1 2236	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦)
39		nfcvd 2923	. . . . . . . . . . . . . . . . 17 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑧𝑤)
40		nfcvf2 2949	. . . . . . . . . . . . . . . . . 18 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑧𝑦)
41	40	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑧𝑦)
42	39, 41	nfeqd 2932	. . . . . . . . . . . . . . . 16 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → Ⅎ𝑧 𝑤 = 𝑦)
43	17, 42	nfan1 2236	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑧((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦)
44		elequ2 2160	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = 𝑦 → (𝑥 ∈ 𝑤 ↔ 𝑥 ∈ 𝑦))
45	44	adantl 487	. . . . . . . . . . . . . . 15 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → (𝑥 ∈ 𝑤 ↔ 𝑥 ∈ 𝑦))
46	43, 45	exbid 2259	. . . . . . . . . . . . . 14 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → (∃𝑧 𝑥 ∈ 𝑤 ↔ ∃𝑧 𝑥 ∈ 𝑦))
47		biidd 265	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧))
48	47	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (𝑤 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧)))
49	5, 22, 48	cbvald 2436	. . . . . . . . . . . . . . 15 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (∀𝑤 𝑥 ∈ 𝑧 ↔ ∀𝑦 𝑥 ∈ 𝑧))
50	49	adantr 486	. . . . . . . . . . . . . 14 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → (∀𝑤 𝑥 ∈ 𝑧 ↔ ∀𝑦 𝑥 ∈ 𝑧))
51	46, 50	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → ((∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) ↔ (∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧)))
52	38, 51	albid 2258	. . . . . . . . . . . 12 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → (∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) ↔ ∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧)))
53		elequ1 2152	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑦 → (𝑤 ∈ 𝑥 ↔ 𝑦 ∈ 𝑥))
54	53	adantl 487	. . . . . . . . . . . 12 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → (𝑤 ∈ 𝑥 ↔ 𝑦 ∈ 𝑥))
55	52, 54	imbi12d 347	. . . . . . . . . . 11 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → ((∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥) ↔ (∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
56	55	ex 418	. . . . . . . . . 10 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (𝑤 = 𝑦 → ((∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥) ↔ (∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))))
57	5, 27, 56	cbvald 2436	. . . . . . . . 9 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥) ↔ ∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
58	13, 57	exbid 2259	. . . . . . . 8 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥) ↔ ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
59	58	adantr 486	. . . . . . 7 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → (∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥) ↔ ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
60	33, 59	imbi12d 347	. . . . . 6 ⊢ (((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) ∧ 𝑤 = 𝑦) → ((¬ 𝑥 = 𝑤 → ∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥)) ↔ (¬ 𝑥 = 𝑦 → ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))))
61	60	ex 418	. . . . 5 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (𝑤 = 𝑦 → ((¬ 𝑥 = 𝑤 → ∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥)) ↔ (¬ 𝑥 = 𝑦 → ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))))
62	5, 30, 61	cbvald 2436	. . . 4 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (∀𝑤(¬ 𝑥 = 𝑤 → ∃𝑥∀𝑤(∀𝑥(∃𝑧 𝑥 ∈ 𝑤 → ∀𝑤 𝑥 ∈ 𝑧) → 𝑤 ∈ 𝑥)) ↔ ∀𝑦(¬ 𝑥 = 𝑦 → ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))))
63	2, 62	mpbii 236	. . 3 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → ∀𝑦(¬ 𝑥 = 𝑦 → ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
64	63	19.21bi 2225	. 2 ⊢ ((¬ ∀𝑦 𝑦 = 𝑥 ∧ ¬ ∀𝑦 𝑦 = 𝑧) → (¬ 𝑥 = 𝑦 → ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)))
65	64	ex 418	1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (¬ ∀𝑦 𝑦 = 𝑧 → (¬ 𝑥 = 𝑦 → ∃𝑥∀𝑦(∀𝑥(∃𝑧 𝑥 ∈ 𝑦 → ∀𝑦 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))))

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

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2401  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-reg 9564

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-v 3452  df-dif 3902  df-ss 3916  df-nul 4280  df-pw 4559  df-sn 4585

This theorem is used by:  axpownd  10610