Mathbox for Scott Fenton < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfiota3 Structured version   Visualization version   GIF version

Theorem dfiota3 32155
 Description: A definiton 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.
StepHypRef Expression
1 df-iota 5889 . 2 (℩𝑥𝜑) = {𝑦 ∣ {𝑥𝜑} = {𝑦}}
2 abeq1 2762 . . . . 5 ({𝑦 ∣ {𝑥𝜑} = {𝑦}} = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})} ↔ ∀𝑦({𝑥𝜑} = {𝑦} ↔ 𝑦 {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}))
3 exdistr 1922 . . . . . 6 (∃𝑧𝑤(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})) ↔ ∃𝑧(𝑦𝑧 ∧ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
4 vex 3234 . . . . . . . . 9 𝑦 ∈ V
5 sneq 4220 . . . . . . . . . 10 (𝑤 = 𝑦 → {𝑤} = {𝑦})
65eqeq2d 2661 . . . . . . . . 9 (𝑤 = 𝑦 → ({𝑥𝜑} = {𝑤} ↔ {𝑥𝜑} = {𝑦}))
74, 6ceqsexv 3273 . . . . . . . 8 (∃𝑤(𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}) ↔ {𝑥𝜑} = {𝑦})
8 snex 4938 . . . . . . . . . . 11 {𝑤} ∈ V
9 eqeq1 2655 . . . . . . . . . . . . 13 (𝑧 = {𝑤} → (𝑧 = {𝑥𝜑} ↔ {𝑤} = {𝑥𝜑}))
10 eleq2 2719 . . . . . . . . . . . . 13 (𝑧 = {𝑤} → (𝑦𝑧𝑦 ∈ {𝑤}))
119, 10anbi12d 747 . . . . . . . . . . . 12 (𝑧 = {𝑤} → ((𝑧 = {𝑥𝜑} ∧ 𝑦𝑧) ↔ ({𝑤} = {𝑥𝜑} ∧ 𝑦 ∈ {𝑤})))
12 eqcom 2658 . . . . . . . . . . . . 13 ({𝑤} = {𝑥𝜑} ↔ {𝑥𝜑} = {𝑤})
13 velsn 4226 . . . . . . . . . . . . . 14 (𝑦 ∈ {𝑤} ↔ 𝑦 = 𝑤)
14 equcom 1991 . . . . . . . . . . . . . 14 (𝑦 = 𝑤𝑤 = 𝑦)
1513, 14bitri 264 . . . . . . . . . . . . 13 (𝑦 ∈ {𝑤} ↔ 𝑤 = 𝑦)
1612, 15anbi12ci 734 . . . . . . . . . . . 12 (({𝑤} = {𝑥𝜑} ∧ 𝑦 ∈ {𝑤}) ↔ (𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}))
1711, 16syl6bb 276 . . . . . . . . . . 11 (𝑧 = {𝑤} → ((𝑧 = {𝑥𝜑} ∧ 𝑦𝑧) ↔ (𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤})))
188, 17ceqsexv 3273 . . . . . . . . . 10 (∃𝑧(𝑧 = {𝑤} ∧ (𝑧 = {𝑥𝜑} ∧ 𝑦𝑧)) ↔ (𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}))
19 an13 857 . . . . . . . . . . 11 ((𝑧 = {𝑤} ∧ (𝑧 = {𝑥𝜑} ∧ 𝑦𝑧)) ↔ (𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2019exbii 1814 . . . . . . . . . 10 (∃𝑧(𝑧 = {𝑤} ∧ (𝑧 = {𝑥𝜑} ∧ 𝑦𝑧)) ↔ ∃𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2118, 20bitr3i 266 . . . . . . . . 9 ((𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}) ↔ ∃𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2221exbii 1814 . . . . . . . 8 (∃𝑤(𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}) ↔ ∃𝑤𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
237, 22bitr3i 266 . . . . . . 7 ({𝑥𝜑} = {𝑦} ↔ ∃𝑤𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
24 excom 2082 . . . . . . 7 (∃𝑤𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})) ↔ ∃𝑧𝑤(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2523, 24bitri 264 . . . . . 6 ({𝑥𝜑} = {𝑦} ↔ ∃𝑧𝑤(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
26 eluniab 4479 . . . . . 6 (𝑦 {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})} ↔ ∃𝑧(𝑦𝑧 ∧ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
273, 25, 263bitr4i 292 . . . . 5 ({𝑥𝜑} = {𝑦} ↔ 𝑦 {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})})
282, 27mpgbir 1766 . . . 4 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
29 df-sn 4211 . . . . . . 7 {{𝑥𝜑}} = {𝑧𝑧 = {𝑥𝜑}}
30 dfsingles2 32153 . . . . . . 7 Singletons = {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}
3129, 30ineq12i 3845 . . . . . 6 ({{𝑥𝜑}} ∩ Singletons ) = ({𝑧𝑧 = {𝑥𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}})
32 inab 3928 . . . . . . 7 ({𝑧𝑧 = {𝑥𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}) = {𝑧 ∣ (𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤})}
33 19.42v 1921 . . . . . . . . 9 (∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤}) ↔ (𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤}))
3433bicomi 214 . . . . . . . 8 ((𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤}) ↔ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤}))
3534abbii 2768 . . . . . . 7 {𝑧 ∣ (𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤})} = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3632, 35eqtri 2673 . . . . . 6 ({𝑧𝑧 = {𝑥𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3731, 36eqtri 2673 . . . . 5 ({{𝑥𝜑}} ∩ Singletons ) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3837unieqi 4477 . . . 4 ({{𝑥𝜑}} ∩ Singletons ) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3928, 38eqtr4i 2676 . . 3 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = ({{𝑥𝜑}} ∩ Singletons )
4039unieqi 4477 . 2 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = ({{𝑥𝜑}} ∩ Singletons )
411, 40eqtri 2673 1 (℩𝑥𝜑) = ({{𝑥𝜑}} ∩ Singletons )
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   = wceq 1523  ∃wex 1744   ∈ wcel 2030  {cab 2637   ∩ cin 3606  {csn 4210  ∪ cuni 4468  ℩cio 5887   Singletons csingles 32071 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-symdif 3877  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-eprel 5058  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fo 5932  df-fv 5934  df-1st 7210  df-2nd 7211  df-txp 32086  df-singleton 32094  df-singles 32095 This theorem is referenced by:  dffv5  32156
 Copyright terms: Public domain W3C validator