Theorem sn-iotalem 41345

Description: An unused lemma showing that many equivalences involving df-iota 6496 are potentially provable without ax-10 2136, ax-11 2153, ax-12 2170. (Contributed by SN, 6-Nov-2024.)

Assertion

Ref	Expression
sn-iotalem	⊢ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧 ∣ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧}}

Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑦,𝑧

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem sn-iotalem

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2735	. . . . . . 7 ⊢ ({𝑥 ∣ 𝜑} = {𝑤} → ({𝑥 ∣ 𝜑} = {𝑧} ↔ {𝑤} = {𝑧}))
2		sneqbg 4845	. . . . . . . . 9 ⊢ (𝑤 ∈ V → ({𝑤} = {𝑧} ↔ 𝑤 = 𝑧))
3	2	elv 3479	. . . . . . . 8 ⊢ ({𝑤} = {𝑧} ↔ 𝑤 = 𝑧)
4		equcom 2020	. . . . . . . 8 ⊢ (𝑤 = 𝑧 ↔ 𝑧 = 𝑤)
5	3, 4	bitri 274	. . . . . . 7 ⊢ ({𝑤} = {𝑧} ↔ 𝑧 = 𝑤)
6	1, 5	bitrdi 286	. . . . . 6 ⊢ ({𝑥 ∣ 𝜑} = {𝑤} → ({𝑥 ∣ 𝜑} = {𝑧} ↔ 𝑧 = 𝑤))
7		sneq 4639	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
8	7	eqeq2d 2742	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ({𝑥 ∣ 𝜑} = {𝑦} ↔ {𝑥 ∣ 𝜑} = {𝑧}))
9	8	elabg 3667	. . . . . . 7 ⊢ (𝑧 ∈ V → (𝑧 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} ↔ {𝑥 ∣ 𝜑} = {𝑧}))
10	9	elv 3479	. . . . . 6 ⊢ (𝑧 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} ↔ {𝑥 ∣ 𝜑} = {𝑧})
11		velsn 4645	. . . . . 6 ⊢ (𝑧 ∈ {𝑤} ↔ 𝑧 = 𝑤)
12	6, 10, 11	3bitr4g 313	. . . . 5 ⊢ ({𝑥 ∣ 𝜑} = {𝑤} → (𝑧 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} ↔ 𝑧 ∈ {𝑤}))
13	12	eqrdv 2729	. . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑤} → {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤})
14		vsnid 4666	. . . . . 6 ⊢ 𝑤 ∈ {𝑤}
15		eleq2 2821	. . . . . 6 ⊢ ({𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤} → (𝑤 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} ↔ 𝑤 ∈ {𝑤}))
16	14, 15	mpbiri 257	. . . . 5 ⊢ ({𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤} → 𝑤 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}})
17		sneq 4639	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → {𝑦} = {𝑤})
18	17	eqeq2d 2742	. . . . . . 7 ⊢ (𝑦 = 𝑤 → ({𝑥 ∣ 𝜑} = {𝑦} ↔ {𝑥 ∣ 𝜑} = {𝑤}))
19	18	elabg 3667	. . . . . 6 ⊢ (𝑤 ∈ V → (𝑤 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} ↔ {𝑥 ∣ 𝜑} = {𝑤}))
20	19	elv 3479	. . . . 5 ⊢ (𝑤 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} ↔ {𝑥 ∣ 𝜑} = {𝑤})
21	16, 20	sylib 217	. . . 4 ⊢ ({𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤} → {𝑥 ∣ 𝜑} = {𝑤})
22	13, 21	impbii 208	. . 3 ⊢ ({𝑥 ∣ 𝜑} = {𝑤} ↔ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤})
23		sneq 4639	. . . . . 6 ⊢ (𝑧 = 𝑤 → {𝑧} = {𝑤})
24	23	eqeq2d 2742	. . . . 5 ⊢ (𝑧 = 𝑤 → ({𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧} ↔ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤}))
25	24	elabg 3667	. . . 4 ⊢ (𝑤 ∈ V → (𝑤 ∈ {𝑧 ∣ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧}} ↔ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤}))
26	25	elv 3479	. . 3 ⊢ (𝑤 ∈ {𝑧 ∣ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧}} ↔ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑤})
27	22, 20, 26	3bitr4i 302	. 2 ⊢ (𝑤 ∈ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} ↔ 𝑤 ∈ {𝑧 ∣ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧}})
28	27	eqriv 2728	1 ⊢ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧 ∣ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑧}}

Syntax hints:   ↔ wb 205   = wceq 1540   ∈ wcel 2105  {cab 2708  Vcvv 3473  {csn 4629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2702

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1543  df-ex 1781  df-sb 2067  df-clab 2709  df-cleq 2723  df-clel 2809  df-v 3475  df-sn 4630

This theorem is referenced by:  sn-iotalemcor  41346