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

Theorem mo4 1029
Description: "At most one" expressed using implicit substitution.
Hypothesis
Ref Expression
mo4.1 |- (x = y -> (ph <-> ps))
Assertion
Ref Expression
mo4 |- (E*xph <-> A.xA.y((ph /\ ps) -> x = y))
Distinct variable group(s):   x,y   ph,y   ps,x

Proof of Theorem mo4
StepHypRef Expression
1 ax-17 925 . 2 |- (ps -> A.xps)
2 mo4.1 . 2 |- (x = y -> (ph <-> ps))
31, 2mo4f 1028 1 |- (E*xph <-> A.xA.y((ph /\ ps) -> x = y))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127   /\ wa 196  A.wal 672   = weq 797  E*wmo 1008
This theorem is referenced by:  eu4 1036  supmo 2156  dffun3 2675  f1fv 2916  caoprmo 3084  th3qlem1 3250
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