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

Theorem reuhypd 4470
Description: A theorem useful for eliminating restricted existential uniqueness hypotheses. (Contributed by NM, 16-Jan-2012.)
Hypotheses
Ref Expression
reuhypd.1 ((𝜑𝑥𝐶) → 𝐵𝐶)
reuhypd.2 ((𝜑𝑥𝐶𝑦𝐶) → (𝑥 = 𝐴𝑦 = 𝐵))
Assertion
Ref Expression
reuhypd ((𝜑𝑥𝐶) → ∃!𝑦𝐶 𝑥 = 𝐴)
Distinct variable groups:   𝜑,𝑦   𝑦,𝐵   𝑦,𝐶   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥,𝑦)   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem reuhypd
StepHypRef Expression
1 reuhypd.1 . . . . 5 ((𝜑𝑥𝐶) → 𝐵𝐶)
2 elex 2748 . . . . 5 (𝐵𝐶𝐵 ∈ V)
31, 2syl 14 . . . 4 ((𝜑𝑥𝐶) → 𝐵 ∈ V)
4 eueq 2908 . . . 4 (𝐵 ∈ V ↔ ∃!𝑦 𝑦 = 𝐵)
53, 4sylib 122 . . 3 ((𝜑𝑥𝐶) → ∃!𝑦 𝑦 = 𝐵)
6 eleq1 2240 . . . . . . 7 (𝑦 = 𝐵 → (𝑦𝐶𝐵𝐶))
71, 6syl5ibrcom 157 . . . . . 6 ((𝜑𝑥𝐶) → (𝑦 = 𝐵𝑦𝐶))
87pm4.71rd 394 . . . . 5 ((𝜑𝑥𝐶) → (𝑦 = 𝐵 ↔ (𝑦𝐶𝑦 = 𝐵)))
9 reuhypd.2 . . . . . . 7 ((𝜑𝑥𝐶𝑦𝐶) → (𝑥 = 𝐴𝑦 = 𝐵))
1093expa 1203 . . . . . 6 (((𝜑𝑥𝐶) ∧ 𝑦𝐶) → (𝑥 = 𝐴𝑦 = 𝐵))
1110pm5.32da 452 . . . . 5 ((𝜑𝑥𝐶) → ((𝑦𝐶𝑥 = 𝐴) ↔ (𝑦𝐶𝑦 = 𝐵)))
128, 11bitr4d 191 . . . 4 ((𝜑𝑥𝐶) → (𝑦 = 𝐵 ↔ (𝑦𝐶𝑥 = 𝐴)))
1312eubidv 2034 . . 3 ((𝜑𝑥𝐶) → (∃!𝑦 𝑦 = 𝐵 ↔ ∃!𝑦(𝑦𝐶𝑥 = 𝐴)))
145, 13mpbid 147 . 2 ((𝜑𝑥𝐶) → ∃!𝑦(𝑦𝐶𝑥 = 𝐴))
15 df-reu 2462 . 2 (∃!𝑦𝐶 𝑥 = 𝐴 ↔ ∃!𝑦(𝑦𝐶𝑥 = 𝐴))
1614, 15sylibr 134 1 ((𝜑𝑥𝐶) → ∃!𝑦𝐶 𝑥 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 978   = wceq 1353  ∃!weu 2026  wcel 2148  ∃!wreu 2457  Vcvv 2737
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-reu 2462  df-v 2739
This theorem is referenced by:  reuhyp  4471
  Copyright terms: Public domain W3C validator