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

Theorem mooran2 2153
Description: "At most one" exports disjunction to conjunction. (Contributed by NM, 5-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
mooran2  |-  ( E* x ( ph  \/  ps )  ->  ( E* x ph  /\  E* x ps ) )

Proof of Theorem mooran2
StepHypRef Expression
1 moor 2151 . 2  |-  ( E* x ( ph  \/  ps )  ->  E* x ph )
2 olc 719 . . 3  |-  ( ps 
->  ( ph  \/  ps ) )
32moimi 2145 . 2  |-  ( E* x ( ph  \/  ps )  ->  E* x ps )
41, 3jca 306 1  |-  ( E* x ( ph  \/  ps )  ->  ( E* x ph  /\  E* x ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 716   E*wmo 2080
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584
This theorem depends on definitions:  df-bi 117  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator