Users' Mathboxes Mathbox for Andrew Salmon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iotasbc Structured version   Visualization version   GIF version

Theorem iotasbc 45170
Description: Definition *14.01 in [WhiteheadRussell] p. 184. In Principia Mathematica, Russell and Whitehead define in terms of a function of (℩𝑥𝜑). Their definition differs in that a function of (℩𝑥𝜑) evaluates to "false" when there isn't a single 𝑥 that satisfies 𝜑. (Contributed by Andrew Salmon, 11-Jul-2011.)
Assertion
Ref Expression
iotasbc (∃!𝑥𝜑 → ([(℩𝑥𝜑) / 𝑦]𝜓 ↔ ∃𝑦(∀𝑥(𝜑𝑥 = 𝑦) ∧ 𝜓)))
Distinct variable groups:   𝑥,𝑦   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥, 𝑦)

Proof of Theorem iotasbc
StepHypRef Expression
1 sbc5 3775 . 2 ([(℩𝑥𝜑) / 𝑦]𝜓 ↔ ∃𝑦(𝑦 = (℩𝑥𝜑) ∧ 𝜓))
2 iotaexeu 45169 . . . . . . 7 (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V)
3 eueq 3674 . . . . . . 7 ((℩𝑥𝜑) ∈ V ↔ ∃!𝑦 𝑦 = (℩𝑥𝜑))
42, 3sylib 221 . . . . . 6 (∃!𝑥𝜑 → ∃!𝑦 𝑦 = (℩𝑥𝜑))
5 eu6 2605 . . . . . . 7 (∃!𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦))
6 iotaval 6517 . . . . . . . . . 10 (∀𝑥(𝜑𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦)
76eqcomd 2772 . . . . . . . . 9 (∀𝑥(𝜑𝑥 = 𝑦) → 𝑦 = (℩𝑥𝜑))
87ancri 559 . . . . . . . 8 (∀𝑥(𝜑𝑥 = 𝑦) → (𝑦 = (℩𝑥𝜑) ∧ ∀𝑥(𝜑𝑥 = 𝑦)))
98eximi 1868 . . . . . . 7 (∃𝑦𝑥(𝜑𝑥 = 𝑦) → ∃𝑦(𝑦 = (℩𝑥𝜑) ∧ ∀𝑥(𝜑𝑥 = 𝑦)))
105, 9sylbi 220 . . . . . 6 (∃!𝑥𝜑 → ∃𝑦(𝑦 = (℩𝑥𝜑) ∧ ∀𝑥(𝜑𝑥 = 𝑦)))
11 eupick 2664 . . . . . 6 ((∃!𝑦 𝑦 = (℩𝑥𝜑) ∧ ∃𝑦(𝑦 = (℩𝑥𝜑) ∧ ∀𝑥(𝜑𝑥 = 𝑦))) → (𝑦 = (℩𝑥𝜑) → ∀𝑥(𝜑𝑥 = 𝑦)))
124, 10, 11syl2anc 596 . . . . 5 (∃!𝑥𝜑 → (𝑦 = (℩𝑥𝜑) → ∀𝑥(𝜑𝑥 = 𝑦)))
1312, 7impbid1 228 . . . 4 (∃!𝑥𝜑 → (𝑦 = (℩𝑥𝜑) ↔ ∀𝑥(𝜑𝑥 = 𝑦)))
1413anbi1d 643 . . 3 (∃!𝑥𝜑 → ((𝑦 = (℩𝑥𝜑) ∧ 𝜓) ↔ (∀𝑥(𝜑𝑥 = 𝑦) ∧ 𝜓)))
1514exbidv 1954 . 2 (∃!𝑥𝜑 → (∃𝑦(𝑦 = (℩𝑥𝜑) ∧ 𝜓) ↔ ∃𝑦(∀𝑥(𝜑𝑥 = 𝑦) ∧ 𝜓)))
161, 15bitrid 286 1 (∃!𝑥𝜑 → ([(℩𝑥𝜑) / 𝑦]𝜓 ↔ ∃𝑦(∀𝑥(𝜑𝑥 = 𝑦) ∧ 𝜓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wal 1568   = wceq 1570  wex 1812  wcel 2146  ∃!weu 2599  Vcvv 3458  [wsbc 3747  cio 6497
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 2148  ax-9 2156  ax-10 2179  ax-12 2216  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-v 3460  df-sbc 3748  df-un 3913  df-ss 3925  df-sn 4595  df-pr 4597  df-uni 4878  df-iota 6499
This theorem is used by:  iotasbc2  45171  iotavalb  45181  fvsb  45201
  Copyright terms: Public domain W3C validator