HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem mooran1 1049
Description: "At most one" imports disjunction to conjunction.
Assertion
Ref Expression
mooran1 |- ((E*xph \/ E*xps) -> E*x(ph /\ ps))

Proof of Theorem mooran1
StepHypRef Expression
1 moan 1046 . . 3 |- (E*xph -> E*x(ps /\ ph))
2 ancom 333 . . . 4 |- ((ps /\ ph) <-> (ph /\ ps))
32bimo 1031 . . 3 |- (E*x(ps /\ ph) <-> E*x(ph /\ ps))
41, 3sylib 173 . 2 |- (E*xph -> E*x(ph /\ ps))
5 moan 1046 . 2 |- (E*xps -> E*x(ph /\ ps))
64, 5jaoi 275 1 |- ((E*xph \/ E*xps) -> E*x(ph /\ ps))
Colors of variables: wff set class
Syntax hints:   -> wi 2   \/ wo 195   /\ wa 196  E*wmo 1008
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010
metamath.org