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

Theorem rmoi 3044
Description: Consequence of "at most one", using implicit substitution. (Contributed by NM, 4-Nov-2012.) (Revised by NM, 16-Jun-2017.)
Hypotheses
Ref Expression
rmoi.b (𝑥 = 𝐵 → (𝜑𝜓))
rmoi.c (𝑥 = 𝐶 → (𝜑𝜒))
Assertion
Ref Expression
rmoi ((∃*𝑥𝐴 𝜑 ∧ (𝐵𝐴𝜓) ∧ (𝐶𝐴𝜒)) → 𝐵 = 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜓,𝑥   𝜒,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rmoi
StepHypRef Expression
1 rmoi.b . . 3 (𝑥 = 𝐵 → (𝜑𝜓))
2 rmoi.c . . 3 (𝑥 = 𝐶 → (𝜑𝜒))
31, 2rmob 3043 . 2 ((∃*𝑥𝐴 𝜑 ∧ (𝐵𝐴𝜓)) → (𝐵 = 𝐶 ↔ (𝐶𝐴𝜒)))
43biimp3ar 1336 1 ((∃*𝑥𝐴 𝜑 ∧ (𝐵𝐴𝜓) ∧ (𝐶𝐴𝜒)) → 𝐵 = 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 968   = wceq 1343  wcel 2136  ∃*wrmo 2447
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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rmo 2452  df-v 2728
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator