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

Theorem moi2 2690
Description: Consequence of "at most one." (Contributed by NM, 29-Jun-2008.)
Hypothesis
Ref Expression
moi2.1 (x = A → (φψ))
Assertion
Ref Expression
moi2 (((A B ∃*xφ) (φ ψ)) → x = A)
Distinct variable groups:   x,A   ψ,x
Allowed substitution hints:   φ(x)   B(x)

Proof of Theorem moi2
StepHypRef Expression
1 moi2.1 . . . . 5 (x = A → (φψ))
21mob2 2689 . . . 4 ((A B ∃*xφ φ) → (x = Aψ))
323expa 1085 . . 3 (((A B ∃*xφ) φ) → (x = Aψ))
43biimprd 147 . 2 (((A B ∃*xφ) φ) → (ψx = A))
54impr 361 1 (((A B ∃*xφ) (φ ψ)) → x = A)
Colors of variables: wff set class
Syntax hints:  wi 4   wa 97  wb 98   = wceq 1223   wcel 1366  ∃*wmo 1874
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 614  ax-5 1309  ax-7 1310  ax-gen 1311  ax-ie1 1355  ax-ie2 1356  ax-8 1368  ax-10 1369  ax-11 1370  ax-i12 1371  ax-bnd 1372  ax-4 1373  ax-17 1392  ax-i9 1396  ax-ial 1400  ax-i5r 1401  ax-ext 1995
This theorem depends on definitions:  df-bi 110  df-3an 869  df-tru 1226  df-nf 1323  df-sb 1619  df-eu 1876  df-mo 1877  df-clab 2000  df-cleq 2006  df-clel 2009  df-nfc 2140  df-v 2528
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator