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

Theorem reu2 2918
Description: A way to express restricted uniqueness. (Contributed by NM, 22-Nov-1994.)
Assertion
Ref Expression
reu2 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∀𝑥𝐴𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reu2
StepHypRef Expression
1 nfv 1521 . . 3 𝑦(𝑥𝐴𝜑)
21eu2 2063 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∀𝑥𝑦(((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦)))
3 df-reu 2455 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
4 df-rex 2454 . . 3 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
5 df-ral 2453 . . . 4 (∀𝑥𝐴𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → ∀𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
6 19.21v 1866 . . . . . 6 (∀𝑦(𝑥𝐴 → (𝑦𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))) ↔ (𝑥𝐴 → ∀𝑦(𝑦𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
7 nfv 1521 . . . . . . . . . . . . 13 𝑥 𝑦𝐴
8 nfs1v 1932 . . . . . . . . . . . . 13 𝑥[𝑦 / 𝑥]𝜑
97, 8nfan 1558 . . . . . . . . . . . 12 𝑥(𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑)
10 eleq1 2233 . . . . . . . . . . . . 13 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
11 sbequ12 1764 . . . . . . . . . . . . 13 (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
1210, 11anbi12d 470 . . . . . . . . . . . 12 (𝑥 = 𝑦 → ((𝑥𝐴𝜑) ↔ (𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑)))
139, 12sbie 1784 . . . . . . . . . . 11 ([𝑦 / 𝑥](𝑥𝐴𝜑) ↔ (𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑))
1413anbi2i 454 . . . . . . . . . 10 (((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) ↔ ((𝑥𝐴𝜑) ∧ (𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑)))
15 an4 581 . . . . . . . . . 10 (((𝑥𝐴𝜑) ∧ (𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑)) ↔ ((𝑥𝐴𝑦𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
1614, 15bitri 183 . . . . . . . . 9 (((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) ↔ ((𝑥𝐴𝑦𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
1716imbi1i 237 . . . . . . . 8 ((((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦) ↔ (((𝑥𝐴𝑦𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦))
18 impexp 261 . . . . . . . 8 ((((𝑥𝐴𝑦𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦) ↔ ((𝑥𝐴𝑦𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
19 impexp 261 . . . . . . . 8 (((𝑥𝐴𝑦𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑥𝐴 → (𝑦𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
2017, 18, 193bitri 205 . . . . . . 7 ((((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦) ↔ (𝑥𝐴 → (𝑦𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
2120albii 1463 . . . . . 6 (∀𝑦(((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑥𝐴 → (𝑦𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
22 df-ral 2453 . . . . . . 7 (∀𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑦𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
2322imbi2i 225 . . . . . 6 ((𝑥𝐴 → ∀𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑥𝐴 → ∀𝑦(𝑦𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
246, 21, 233bitr4i 211 . . . . 5 (∀𝑦(((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦) ↔ (𝑥𝐴 → ∀𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
2524albii 1463 . . . 4 (∀𝑥𝑦(((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → ∀𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
265, 25bitr4i 186 . . 3 (∀𝑥𝐴𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥𝑦(((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦))
274, 26anbi12i 457 . 2 ((∃𝑥𝐴 𝜑 ∧ ∀𝑥𝐴𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∀𝑥𝑦(((𝑥𝐴𝜑) ∧ [𝑦 / 𝑥](𝑥𝐴𝜑)) → 𝑥 = 𝑦)))
282, 3, 273bitr4i 211 1 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∀𝑥𝐴𝑦𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wal 1346  wex 1485  [wsb 1755  ∃!weu 2019  wcel 2141  wral 2448  wrex 2449  ∃!wreu 2450
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-nf 1454  df-sb 1756  df-eu 2022  df-cleq 2163  df-clel 2166  df-ral 2453  df-rex 2454  df-reu 2455
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator