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

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

Proof of Theorem reu6
StepHypRef Expression
1 df-reu 2330 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
2 19.28v 1796 . . . . 5 (∀𝑥(𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) ↔ (𝑦𝐴 ∧ ∀𝑥(𝑥𝐴 → (𝜑𝑥 = 𝑦))))
3 eleq1 2116 . . . . . . . . . . . 12 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
4 sbequ12 1670 . . . . . . . . . . . 12 (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
53, 4anbi12d 450 . . . . . . . . . . 11 (𝑥 = 𝑦 → ((𝑥𝐴𝜑) ↔ (𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑)))
6 equequ1 1614 . . . . . . . . . . 11 (𝑥 = 𝑦 → (𝑥 = 𝑦𝑦 = 𝑦))
75, 6bibi12d 228 . . . . . . . . . 10 (𝑥 = 𝑦 → (((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) ↔ ((𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑) ↔ 𝑦 = 𝑦)))
8 equid 1605 . . . . . . . . . . . 12 𝑦 = 𝑦
98tbt 240 . . . . . . . . . . 11 ((𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑) ↔ ((𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑) ↔ 𝑦 = 𝑦))
10 simpl 106 . . . . . . . . . . 11 ((𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑) → 𝑦𝐴)
119, 10sylbir 129 . . . . . . . . . 10 (((𝑦𝐴 ∧ [𝑦 / 𝑥]𝜑) ↔ 𝑦 = 𝑦) → 𝑦𝐴)
127, 11syl6bi 156 . . . . . . . . 9 (𝑥 = 𝑦 → (((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → 𝑦𝐴))
1312spimv 1708 . . . . . . . 8 (∀𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → 𝑦𝐴)
14 bi1 115 . . . . . . . . . . . 12 (((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → ((𝑥𝐴𝜑) → 𝑥 = 𝑦))
1514expdimp 250 . . . . . . . . . . 11 ((((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) ∧ 𝑥𝐴) → (𝜑𝑥 = 𝑦))
16 bi2 125 . . . . . . . . . . . . 13 (((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → (𝑥 = 𝑦 → (𝑥𝐴𝜑)))
17 simpr 107 . . . . . . . . . . . . 13 ((𝑥𝐴𝜑) → 𝜑)
1816, 17syl6 33 . . . . . . . . . . . 12 (((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → (𝑥 = 𝑦𝜑))
1918adantr 265 . . . . . . . . . . 11 ((((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) ∧ 𝑥𝐴) → (𝑥 = 𝑦𝜑))
2015, 19impbid 124 . . . . . . . . . 10 ((((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) ∧ 𝑥𝐴) → (𝜑𝑥 = 𝑦))
2120ex 112 . . . . . . . . 9 (((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → (𝑥𝐴 → (𝜑𝑥 = 𝑦)))
2221sps 1446 . . . . . . . 8 (∀𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → (𝑥𝐴 → (𝜑𝑥 = 𝑦)))
2313, 22jca 294 . . . . . . 7 (∀𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → (𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))))
2423a5i 1451 . . . . . 6 (∀𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) → ∀𝑥(𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))))
25 bi1 115 . . . . . . . . . . 11 ((𝜑𝑥 = 𝑦) → (𝜑𝑥 = 𝑦))
2625imim2i 12 . . . . . . . . . 10 ((𝑥𝐴 → (𝜑𝑥 = 𝑦)) → (𝑥𝐴 → (𝜑𝑥 = 𝑦)))
2726impd 246 . . . . . . . . 9 ((𝑥𝐴 → (𝜑𝑥 = 𝑦)) → ((𝑥𝐴𝜑) → 𝑥 = 𝑦))
2827adantl 266 . . . . . . . 8 ((𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) → ((𝑥𝐴𝜑) → 𝑥 = 𝑦))
29 eleq1a 2125 . . . . . . . . . . . 12 (𝑦𝐴 → (𝑥 = 𝑦𝑥𝐴))
3029adantr 265 . . . . . . . . . . 11 ((𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) → (𝑥 = 𝑦𝑥𝐴))
3130imp 119 . . . . . . . . . 10 (((𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) ∧ 𝑥 = 𝑦) → 𝑥𝐴)
32 bi2 125 . . . . . . . . . . . . . 14 ((𝜑𝑥 = 𝑦) → (𝑥 = 𝑦𝜑))
3332imim2i 12 . . . . . . . . . . . . 13 ((𝑥𝐴 → (𝜑𝑥 = 𝑦)) → (𝑥𝐴 → (𝑥 = 𝑦𝜑)))
3433com23 76 . . . . . . . . . . . 12 ((𝑥𝐴 → (𝜑𝑥 = 𝑦)) → (𝑥 = 𝑦 → (𝑥𝐴𝜑)))
3534imp 119 . . . . . . . . . . 11 (((𝑥𝐴 → (𝜑𝑥 = 𝑦)) ∧ 𝑥 = 𝑦) → (𝑥𝐴𝜑))
3635adantll 453 . . . . . . . . . 10 (((𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) ∧ 𝑥 = 𝑦) → (𝑥𝐴𝜑))
3731, 36jcai 298 . . . . . . . . 9 (((𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) ∧ 𝑥 = 𝑦) → (𝑥𝐴𝜑))
3837ex 112 . . . . . . . 8 ((𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) → (𝑥 = 𝑦 → (𝑥𝐴𝜑)))
3928, 38impbid 124 . . . . . . 7 ((𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) → ((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦))
4039alimi 1360 . . . . . 6 (∀𝑥(𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))) → ∀𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦))
4124, 40impbii 121 . . . . 5 (∀𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝑦𝐴 ∧ (𝑥𝐴 → (𝜑𝑥 = 𝑦))))
42 df-ral 2328 . . . . . 6 (∀𝑥𝐴 (𝜑𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → (𝜑𝑥 = 𝑦)))
4342anbi2i 438 . . . . 5 ((𝑦𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝑦)) ↔ (𝑦𝐴 ∧ ∀𝑥(𝑥𝐴 → (𝜑𝑥 = 𝑦))))
442, 41, 433bitr4i 205 . . . 4 (∀𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) ↔ (𝑦𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝑦)))
4544exbii 1512 . . 3 (∃𝑦𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦) ↔ ∃𝑦(𝑦𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝑦)))
46 df-eu 1919 . . 3 (∃!𝑥(𝑥𝐴𝜑) ↔ ∃𝑦𝑥((𝑥𝐴𝜑) ↔ 𝑥 = 𝑦))
47 df-rex 2329 . . 3 (∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦) ↔ ∃𝑦(𝑦𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝑦)))
4845, 46, 473bitr4i 205 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
491, 48bitri 177 1 (∃!𝑥𝐴 𝜑 ↔ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  wal 1257  wex 1397  wcel 1409  [wsb 1661  ∃!weu 1916  wral 2323  wrex 2324  ∃!wreu 2325
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-5 1352  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-nf 1366  df-sb 1662  df-eu 1919  df-cleq 2049  df-clel 2052  df-ral 2328  df-rex 2329  df-reu 2330
This theorem is referenced by:  reu3  2753  reu6i  2754  reu8  2759
  Copyright terms: Public domain W3C validator