Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sbmoOLD Unicode version

Theorem sbmoOLD 26339
Description: Substitution into "at most one". (Moved to sbmo 2173 in main set.mm and may be deleted by mathbox owner, JM. --NM 29-Jan-2012.) (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
sbmoOLD  |-  ( [ y  /  x ] E* z ph  <->  E* z [ y  /  x ] ph )
Distinct variable groups:    x, z    y, z
Allowed substitution hints:    ph( x, y, z)

Proof of Theorem sbmoOLD
StepHypRef Expression
1 sbmo 2173 1  |-  ( [ y  /  x ] E* z ph  <->  E* z [ y  /  x ] ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 176   [wsb 1629   E*wmo 2144
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148
  Copyright terms: Public domain W3C validator