Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  reu3 GIF version

Theorem reu3 2731
 Description: A way to express restricted uniqueness. (Contributed by NM, 24-Oct-2006.)
Assertion
Ref Expression
reu3 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reu3
StepHypRef Expression
1 reurex 2523 . . 3 (∃!𝑥𝐴 𝜑 → ∃𝑥𝐴 𝜑)
2 reu6 2730 . . . 4 (∃!𝑥𝐴 𝜑 ↔ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
3 bi1 111 . . . . . 6 ((𝜑𝑥 = 𝑦) → (𝜑𝑥 = 𝑦))
43ralimi 2384 . . . . 5 (∀𝑥𝐴 (𝜑𝑥 = 𝑦) → ∀𝑥𝐴 (𝜑𝑥 = 𝑦))
54reximi 2416 . . . 4 (∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦) → ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
62, 5sylbi 114 . . 3 (∃!𝑥𝐴 𝜑 → ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
71, 6jca 290 . 2 (∃!𝑥𝐴 𝜑 → (∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦)))
8 rexex 2368 . . . 4 (∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦) → ∃𝑦𝑥𝐴 (𝜑𝑥 = 𝑦))
98anim2i 324 . . 3 ((∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦)) → (∃𝑥𝐴 𝜑 ∧ ∃𝑦𝑥𝐴 (𝜑𝑥 = 𝑦)))
10 nfv 1421 . . . . 5 𝑦(𝑥𝐴𝜑)
1110eu3 1946 . . . 4 (∃!𝑥(𝑥𝐴𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃𝑦𝑥((𝑥𝐴𝜑) → 𝑥 = 𝑦)))
12 df-reu 2313 . . . 4 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
13 df-rex 2312 . . . . 5 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
14 df-ral 2311 . . . . . . 7 (∀𝑥𝐴 (𝜑𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → (𝜑𝑥 = 𝑦)))
15 impexp 250 . . . . . . . 8 (((𝑥𝐴𝜑) → 𝑥 = 𝑦) ↔ (𝑥𝐴 → (𝜑𝑥 = 𝑦)))
1615albii 1359 . . . . . . 7 (∀𝑥((𝑥𝐴𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → (𝜑𝑥 = 𝑦)))
1714, 16bitr4i 176 . . . . . 6 (∀𝑥𝐴 (𝜑𝑥 = 𝑦) ↔ ∀𝑥((𝑥𝐴𝜑) → 𝑥 = 𝑦))
1817exbii 1496 . . . . 5 (∃𝑦𝑥𝐴 (𝜑𝑥 = 𝑦) ↔ ∃𝑦𝑥((𝑥𝐴𝜑) → 𝑥 = 𝑦))
1913, 18anbi12i 433 . . . 4 ((∃𝑥𝐴 𝜑 ∧ ∃𝑦𝑥𝐴 (𝜑𝑥 = 𝑦)) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃𝑦𝑥((𝑥𝐴𝜑) → 𝑥 = 𝑦)))
2011, 12, 193bitr4i 201 . . 3 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑦𝑥𝐴 (𝜑𝑥 = 𝑦)))
219, 20sylibr 137 . 2 ((∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦)) → ∃!𝑥𝐴 𝜑)
227, 21impbii 117 1 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98  ∀wal 1241  ∃wex 1381   ∈ wcel 1393  ∃!weu 1900  ∀wral 2306  ∃wrex 2307  ∃!wreu 2308 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022 This theorem depends on definitions:  df-bi 110  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-cleq 2033  df-clel 2036  df-ral 2311  df-rex 2312  df-reu 2313  df-rmo 2314 This theorem is referenced by:  reu7  2736  bdreu  9975
 Copyright terms: Public domain W3C validator