Theorem dfiota3 36501

Description: A definition of iota using minimal quantifiers. (Contributed by Scott Fenton, 19-Feb-2013.)

Assertion

Ref	Expression
dfiota3	⊢ (℩𝑥𝜑) = ∪ ∪ ({{𝑥 ∣ 𝜑}} ∩ Singletons )

Proof of Theorem dfiota3

Dummy variables 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iota 6489	. 2 ⊢ (℩𝑥𝜑) = ∪ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}}
2		eqabcb 2900	. . . . 5 ⊢ ({𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = ∪ {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})} ↔ ∀𝑦({𝑥 ∣ 𝜑} = {𝑦} ↔ 𝑦 ∈ ∪ {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})}))
3		exdistr 1987	. . . . . 6 ⊢ (∃𝑧∃𝑤(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})) ↔ ∃𝑧(𝑦 ∈ 𝑧 ∧ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
4		vex 3454	. . . . . . . . 9 ⊢ 𝑦 ∈ V
5		sneq 4594	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → {𝑤} = {𝑦})
6	5	eqeq2d 2771	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → ({𝑥 ∣ 𝜑} = {𝑤} ↔ {𝑥 ∣ 𝜑} = {𝑦}))
7	4, 6	ceqsexv 3498	. . . . . . . 8 ⊢ (∃𝑤(𝑤 = 𝑦 ∧ {𝑥 ∣ 𝜑} = {𝑤}) ↔ {𝑥 ∣ 𝜑} = {𝑦})
8		vsnex 5400	. . . . . . . . . . 11 ⊢ {𝑤} ∈ V
9		eqeq1 2764	. . . . . . . . . . . . 13 ⊢ (𝑧 = {𝑤} → (𝑧 = {𝑥 ∣ 𝜑} ↔ {𝑤} = {𝑥 ∣ 𝜑}))
10		eleq2 2849	. . . . . . . . . . . . 13 ⊢ (𝑧 = {𝑤} → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑤}))
11	9, 10	anbi12d 644	. . . . . . . . . . . 12 ⊢ (𝑧 = {𝑤} → ((𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ 𝑧) ↔ ({𝑤} = {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑤})))
12		eqcom 2767	. . . . . . . . . . . . 13 ⊢ ({𝑤} = {𝑥 ∣ 𝜑} ↔ {𝑥 ∣ 𝜑} = {𝑤})
13		velsn 4600	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ {𝑤} ↔ 𝑦 = 𝑤)
14		equcom 2051	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑤 ↔ 𝑤 = 𝑦)
15	13, 14	bitri 278	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ {𝑤} ↔ 𝑤 = 𝑦)
16	12, 15	anbi12ci 641	. . . . . . . . . . . 12 ⊢ (({𝑤} = {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑤}) ↔ (𝑤 = 𝑦 ∧ {𝑥 ∣ 𝜑} = {𝑤}))
17	11, 16	bitrdi 290	. . . . . . . . . . 11 ⊢ (𝑧 = {𝑤} → ((𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ 𝑧) ↔ (𝑤 = 𝑦 ∧ {𝑥 ∣ 𝜑} = {𝑤})))
18	8, 17	ceqsexv 3498	. . . . . . . . . 10 ⊢ (∃𝑧(𝑧 = {𝑤} ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ 𝑧)) ↔ (𝑤 = 𝑦 ∧ {𝑥 ∣ 𝜑} = {𝑤}))
19		an13 660	. . . . . . . . . . 11 ⊢ ((𝑧 = {𝑤} ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ 𝑧)) ↔ (𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
20	19	exbii 1881	. . . . . . . . . 10 ⊢ (∃𝑧(𝑧 = {𝑤} ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ 𝑧)) ↔ ∃𝑧(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
21	18, 20	bitr3i 280	. . . . . . . . 9 ⊢ ((𝑤 = 𝑦 ∧ {𝑥 ∣ 𝜑} = {𝑤}) ↔ ∃𝑧(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
22	21	exbii 1881	. . . . . . . 8 ⊢ (∃𝑤(𝑤 = 𝑦 ∧ {𝑥 ∣ 𝜑} = {𝑤}) ↔ ∃𝑤∃𝑧(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
23	7, 22	bitr3i 280	. . . . . . 7 ⊢ ({𝑥 ∣ 𝜑} = {𝑦} ↔ ∃𝑤∃𝑧(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
24		excom 2199	. . . . . . 7 ⊢ (∃𝑤∃𝑧(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})) ↔ ∃𝑧∃𝑤(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
25	23, 24	bitri 278	. . . . . 6 ⊢ ({𝑥 ∣ 𝜑} = {𝑦} ↔ ∃𝑧∃𝑤(𝑦 ∈ 𝑧 ∧ (𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
26		eluniab 4881	. . . . . 6 ⊢ (𝑦 ∈ ∪ {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})} ↔ ∃𝑧(𝑦 ∈ 𝑧 ∧ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})))
27	3, 25, 26	3bitr4i 306	. . . . 5 ⊢ ({𝑥 ∣ 𝜑} = {𝑦} ↔ 𝑦 ∈ ∪ {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})})
28	2, 27	mpgbir 1832	. . . 4 ⊢ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = ∪ {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})}
29		df-sn 4585	. . . . . . 7 ⊢ {{𝑥 ∣ 𝜑}} = {𝑧 ∣ 𝑧 = {𝑥 ∣ 𝜑}}
30		dfsingles2 36499	. . . . . . 7 ⊢ Singletons = {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}
31	29, 30	ineq12i 4164	. . . . . 6 ⊢ ({{𝑥 ∣ 𝜑}} ∩ Singletons ) = ({𝑧 ∣ 𝑧 = {𝑥 ∣ 𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}})
32		inab 4255	. . . . . . 7 ⊢ ({𝑧 ∣ 𝑧 = {𝑥 ∣ 𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}) = {𝑧 ∣ (𝑧 = {𝑥 ∣ 𝜑} ∧ ∃𝑤 𝑧 = {𝑤})}
33		19.42v 1986	. . . . . . . . 9 ⊢ (∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤}) ↔ (𝑧 = {𝑥 ∣ 𝜑} ∧ ∃𝑤 𝑧 = {𝑤}))
34	33	bicomi 227	. . . . . . . 8 ⊢ ((𝑧 = {𝑥 ∣ 𝜑} ∧ ∃𝑤 𝑧 = {𝑤}) ↔ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤}))
35	34	abbii 2827	. . . . . . 7 ⊢ {𝑧 ∣ (𝑧 = {𝑥 ∣ 𝜑} ∧ ∃𝑤 𝑧 = {𝑤})} = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})}
36	32, 35	eqtri 2783	. . . . . 6 ⊢ ({𝑧 ∣ 𝑧 = {𝑥 ∣ 𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})}
37	31, 36	eqtri 2783	. . . . 5 ⊢ ({{𝑥 ∣ 𝜑}} ∩ Singletons ) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})}
38	37	unieqi 4879	. . . 4 ⊢ ∪ ({{𝑥 ∣ 𝜑}} ∩ Singletons ) = ∪ {𝑧 ∣ ∃𝑤(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 = {𝑤})}
39	28, 38	eqtr4i 2786	. . 3 ⊢ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = ∪ ({{𝑥 ∣ 𝜑}} ∩ Singletons )
40	39	unieqi 4879	. 2 ⊢ ∪ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = ∪ ∪ ({{𝑥 ∣ 𝜑}} ∩ Singletons )
41	1, 40	eqtri 2783	1 ⊢ (℩𝑥𝜑) = ∪ ∪ ({{𝑥 ∣ 𝜑}} ∩ Singletons )

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738   ∩ cin 3898  {csn 4584  ∪ cuni 4867  ℩cio 6487   Singletons csingles 36417

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-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-symdif 4199  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-eprel 5555  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-1st 7987  df-2nd 7988  df-txp 36432  df-singleton 36440  df-singles 36441

This theorem is used by:  dffv5  36502