Theorem mh-setindnd 36861

Description: A version of mh-setind 36860 with no distinct variable conditions. (Contributed by Matthew House, 5-Mar-2026.) (New usage is discouraged.)

Assertion

Ref	Expression
mh-setindnd	⊢ (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → 𝜑)

Proof of Theorem mh-setindnd

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sp 2217	. . . . . 6 ⊢ (∀𝑦𝜑 → 𝜑)
2	1	imim2i 16	. . . . 5 ⊢ ((𝑥 ∈ 𝑦 → ∀𝑦𝜑) → (𝑥 ∈ 𝑦 → 𝜑))
3	2	alimi 1830	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 ∈ 𝑦 → 𝜑))
4	3	imim1i 63	. . 3 ⊢ ((∀𝑥(𝑥 ∈ 𝑦 → 𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → (∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)))
5	4	alimi 1830	. 2 ⊢ (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)))
6		elirrv 9542	. . . . . . . 8 ⊢ ¬ 𝑥 ∈ 𝑥
7		elequ2 2156	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑥 ∈ 𝑦))
8	6, 7	mtbii 328	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ¬ 𝑥 ∈ 𝑦)
9	8	pm2.21d 121	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑦 → ∀𝑦𝜑))
10	9	alimi 1830	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑))
11		sp 2217	. . . . . . 7 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝑥 = 𝑦)
12	1	a1i 11	. . . . . . 7 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜑 → 𝜑))
13	11, 12	embantd 59	. . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑦 → ∀𝑦𝜑) → 𝜑))
14	13	spsd 2221	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑) → 𝜑))
15	10, 14	embantd 59	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ((∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → 𝜑))
16	15	spsd 2221	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → 𝜑))
17		nfnae 2464	. . . . 5 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
18		nfnae 2464	. . . . . . 7 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
19		dveel1 2491	. . . . . . . . . 10 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑥 ∈ 𝑧 → ∀𝑦 𝑥 ∈ 𝑧))
20	19	naecoms 2459	. . . . . . . . 9 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 ∈ 𝑧 → ∀𝑦 𝑥 ∈ 𝑧))
21	17, 20	nf5d 2317	. . . . . . . 8 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦 𝑥 ∈ 𝑧)
22		nfa1 2184	. . . . . . . . 9 ⊢ Ⅎ𝑦∀𝑦𝜑
23	22	a1i 11	. . . . . . . 8 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦∀𝑦𝜑)
24	21, 23	nfimd 1913	. . . . . . 7 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦(𝑥 ∈ 𝑧 → ∀𝑦𝜑))
25	18, 24	nfald 2359	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑))
26		nfeqf1 2409	. . . . . . . . 9 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 𝑥 = 𝑧)
27	26	naecoms 2459	. . . . . . . 8 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦 𝑥 = 𝑧)
28	27, 23	nfimd 1913	. . . . . . 7 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦(𝑥 = 𝑧 → ∀𝑦𝜑))
29	18, 28	nfald 2359	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑))
30	25, 29	nfimd 1913	. . . . 5 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦(∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑)))
31		nfeqf2 2407	. . . . . . . . 9 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦)
32	18, 31	nfan1 2234	. . . . . . . 8 ⊢ Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦)
33		elequ2 2156	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑦))
34	33	imbi1d 343	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → ((𝑥 ∈ 𝑧 → ∀𝑦𝜑) ↔ (𝑥 ∈ 𝑦 → ∀𝑦𝜑)))
35	34	adantl 485	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → ((𝑥 ∈ 𝑧 → ∀𝑦𝜑) ↔ (𝑥 ∈ 𝑦 → ∀𝑦𝜑)))
36	32, 35	albid 2256	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → (∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑) ↔ ∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑)))
37		equequ2 2045	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑥 = 𝑦))
38	37	imbi1d 343	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → ((𝑥 = 𝑧 → ∀𝑦𝜑) ↔ (𝑥 = 𝑦 → ∀𝑦𝜑)))
39	38	adantl 485	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → ((𝑥 = 𝑧 → ∀𝑦𝜑) ↔ (𝑥 = 𝑦 → ∀𝑦𝜑)))
40	32, 39	albid 2256	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → (∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)))
41	36, 40	imbi12d 346	. . . . . 6 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → ((∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑)) ↔ (∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑))))
42	41	ex 416	. . . . 5 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ((∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑)) ↔ (∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)))))
43	17, 30, 42	cbvaldw 2368	. . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑧(∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑)) ↔ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑))))
44		mh-setind 36860	. . . . 5 ⊢ (∀𝑧(∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑)) → ∀𝑦𝜑)
45	44	19.21bi 2223	. . . 4 ⊢ (∀𝑧(∀𝑥(𝑥 ∈ 𝑧 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑧 → ∀𝑦𝜑)) → 𝜑)
46	43, 45	biimtrrdi 256	. . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → 𝜑))
47	16, 46	pm2.61i 183	. 2 ⊢ (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → 𝜑)
48	5, 47	syl 17	1 ⊢ (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑦𝜑)) → 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 399  ∀wal 1557  Ⅎwnf 1802

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-13 2402  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pr 5389  ax-un 7714  ax-reg 9537  ax-inf2 9593

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-om 7843  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-rdg 8376

This theorem is referenced by: (None)