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

Theorem dfiota3 36064
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.
StepHypRef Expression
1 df-iota 6446 . 2 (℩𝑥𝜑) = {𝑦 ∣ {𝑥𝜑} = {𝑦}}
2 eqabcb 2874 . . . . 5 ({𝑦 ∣ {𝑥𝜑} = {𝑦}} = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})} ↔ ∀𝑦({𝑥𝜑} = {𝑦} ↔ 𝑦 {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}))
3 exdistr 1955 . . . . . 6 (∃𝑧𝑤(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})) ↔ ∃𝑧(𝑦𝑧 ∧ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
4 vex 3442 . . . . . . . . 9 𝑦 ∈ V
5 sneq 4588 . . . . . . . . . 10 (𝑤 = 𝑦 → {𝑤} = {𝑦})
65eqeq2d 2745 . . . . . . . . 9 (𝑤 = 𝑦 → ({𝑥𝜑} = {𝑤} ↔ {𝑥𝜑} = {𝑦}))
74, 6ceqsexv 3488 . . . . . . . 8 (∃𝑤(𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}) ↔ {𝑥𝜑} = {𝑦})
8 vsnex 5377 . . . . . . . . . . 11 {𝑤} ∈ V
9 eqeq1 2738 . . . . . . . . . . . . 13 (𝑧 = {𝑤} → (𝑧 = {𝑥𝜑} ↔ {𝑤} = {𝑥𝜑}))
10 eleq2 2823 . . . . . . . . . . . . 13 (𝑧 = {𝑤} → (𝑦𝑧𝑦 ∈ {𝑤}))
119, 10anbi12d 632 . . . . . . . . . . . 12 (𝑧 = {𝑤} → ((𝑧 = {𝑥𝜑} ∧ 𝑦𝑧) ↔ ({𝑤} = {𝑥𝜑} ∧ 𝑦 ∈ {𝑤})))
12 eqcom 2741 . . . . . . . . . . . . 13 ({𝑤} = {𝑥𝜑} ↔ {𝑥𝜑} = {𝑤})
13 velsn 4594 . . . . . . . . . . . . . 14 (𝑦 ∈ {𝑤} ↔ 𝑦 = 𝑤)
14 equcom 2019 . . . . . . . . . . . . . 14 (𝑦 = 𝑤𝑤 = 𝑦)
1513, 14bitri 275 . . . . . . . . . . . . 13 (𝑦 ∈ {𝑤} ↔ 𝑤 = 𝑦)
1612, 15anbi12ci 629 . . . . . . . . . . . 12 (({𝑤} = {𝑥𝜑} ∧ 𝑦 ∈ {𝑤}) ↔ (𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}))
1711, 16bitrdi 287 . . . . . . . . . . 11 (𝑧 = {𝑤} → ((𝑧 = {𝑥𝜑} ∧ 𝑦𝑧) ↔ (𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤})))
188, 17ceqsexv 3488 . . . . . . . . . 10 (∃𝑧(𝑧 = {𝑤} ∧ (𝑧 = {𝑥𝜑} ∧ 𝑦𝑧)) ↔ (𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}))
19 an13 647 . . . . . . . . . . 11 ((𝑧 = {𝑤} ∧ (𝑧 = {𝑥𝜑} ∧ 𝑦𝑧)) ↔ (𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2019exbii 1849 . . . . . . . . . 10 (∃𝑧(𝑧 = {𝑤} ∧ (𝑧 = {𝑥𝜑} ∧ 𝑦𝑧)) ↔ ∃𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2118, 20bitr3i 277 . . . . . . . . 9 ((𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}) ↔ ∃𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2221exbii 1849 . . . . . . . 8 (∃𝑤(𝑤 = 𝑦 ∧ {𝑥𝜑} = {𝑤}) ↔ ∃𝑤𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
237, 22bitr3i 277 . . . . . . 7 ({𝑥𝜑} = {𝑦} ↔ ∃𝑤𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
24 excom 2167 . . . . . . 7 (∃𝑤𝑧(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})) ↔ ∃𝑧𝑤(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
2523, 24bitri 275 . . . . . 6 ({𝑥𝜑} = {𝑦} ↔ ∃𝑧𝑤(𝑦𝑧 ∧ (𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
26 eluniab 4875 . . . . . 6 (𝑦 {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})} ↔ ∃𝑧(𝑦𝑧 ∧ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})))
273, 25, 263bitr4i 303 . . . . 5 ({𝑥𝜑} = {𝑦} ↔ 𝑦 {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})})
282, 27mpgbir 1800 . . . 4 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
29 df-sn 4579 . . . . . . 7 {{𝑥𝜑}} = {𝑧𝑧 = {𝑥𝜑}}
30 dfsingles2 36062 . . . . . . 7 Singletons = {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}
3129, 30ineq12i 4168 . . . . . 6 ({{𝑥𝜑}} ∩ Singletons ) = ({𝑧𝑧 = {𝑥𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}})
32 inab 4259 . . . . . . 7 ({𝑧𝑧 = {𝑥𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}) = {𝑧 ∣ (𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤})}
33 19.42v 1954 . . . . . . . . 9 (∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤}) ↔ (𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤}))
3433bicomi 224 . . . . . . . 8 ((𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤}) ↔ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤}))
3534abbii 2801 . . . . . . 7 {𝑧 ∣ (𝑧 = {𝑥𝜑} ∧ ∃𝑤 𝑧 = {𝑤})} = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3632, 35eqtri 2757 . . . . . 6 ({𝑧𝑧 = {𝑥𝜑}} ∩ {𝑧 ∣ ∃𝑤 𝑧 = {𝑤}}) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3731, 36eqtri 2757 . . . . 5 ({{𝑥𝜑}} ∩ Singletons ) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3837unieqi 4873 . . . 4 ({{𝑥𝜑}} ∩ Singletons ) = {𝑧 ∣ ∃𝑤(𝑧 = {𝑥𝜑} ∧ 𝑧 = {𝑤})}
3928, 38eqtr4i 2760 . . 3 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = ({{𝑥𝜑}} ∩ Singletons )
4039unieqi 4873 . 2 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = ({{𝑥𝜑}} ∩ Singletons )
411, 40eqtri 2757 1 (℩𝑥𝜑) = ({{𝑥𝜑}} ∩ Singletons )
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wex 1780  wcel 2113  {cab 2712  cin 3898  {csn 4578   cuni 4861  cio 6444   Singletons csingles 35980
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 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-symdif 4203  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-eprel 5522  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fo 6496  df-fv 6498  df-1st 7931  df-2nd 7932  df-txp 35995  df-singleton 36003  df-singles 36004
This theorem is referenced by:  dffv5  36065
  Copyright terms: Public domain W3C validator