Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfaiota2 Structured version   Visualization version   GIF version

Theorem dfaiota2 47628
Description: Alternate definition of the alternate version of Russell's definition of a description binder. Definition 8.18 in [Quine] p. 56. (Contributed by AV, 24-Aug-2022.)
Assertion
Ref Expression
dfaiota2 (℩'𝑥𝜑) = {𝑦 ∣ ∀𝑥(𝜑𝑥 = 𝑦)}
Distinct variable groups:   𝑥,𝑦   𝜑,𝑦
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem dfaiota2
StepHypRef Expression
1 df-aiota 47627 . 2 (℩'𝑥𝜑) = {𝑦 ∣ {𝑥𝜑} = {𝑦}}
2 absn 4596 . . . 4 ({𝑥𝜑} = {𝑦} ↔ ∀𝑥(𝜑𝑥 = 𝑦))
32abbii 2823 . . 3 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = {𝑦 ∣ ∀𝑥(𝜑𝑥 = 𝑦)}
43inteqi 4903 . 2 {𝑦 ∣ {𝑥𝜑} = {𝑦}} = {𝑦 ∣ ∀𝑥(𝜑𝑥 = 𝑦)}
51, 4eqtri 2779 1 (℩'𝑥𝜑) = {𝑦 ∣ ∀𝑥(𝜑𝑥 = 𝑦)}
Colors of variables: wff setvar class
Syntax hints:  wb 208  wal 1552   = wceq 1554  {cab 2734  {csn 4576   cint 4899  ℩'caiota 47625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-tru 1557  df-ex 1794  df-nf 1798  df-sb 2085  df-clab 2735  df-cleq 2748  df-ral 3071  df-rex 3081  df-sn 4577  df-int 4900  df-aiota 47627
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator