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

Theorem drsb1 1175
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint).
Assertion
Ref Expression
drsb1 |- (A.x x = y -> ([z / x]ph <-> [z / y]ph))

Proof of Theorem drsb1
StepHypRef Expression
1 equequ1 1134 . . . . 5 |- (x = y -> (x = z <-> y = z))
21a4s 984 . . . 4 |- (A.x x = y -> (x = z <-> y = z))
32imbi1d 613 . . 3 |- (A.x x = y -> ((x = z -> ph) <-> (y = z -> ph)))
42anbi1d 617 . . . 4 |- (A.x x = y -> ((x = z /\ ph) <-> (y = z /\ ph)))
54drex1 1156 . . 3 |- (A.x x = y -> (E.x(x = z /\ ph) <-> E.y(y = z /\ ph)))
63, 5anbi12d 628 . 2 |- (A.x x = y -> (((x = z -> ph) /\ E.x(x = z /\ ph)) <-> ((y = z -> ph) /\ E.y(y = z /\ ph))))
7 df-sb 1172 . 2 |- ([z / x]ph <-> ((x = z -> ph) /\ E.x(x = z /\ ph)))
8 df-sb 1172 . 2 |- ([z / y]ph <-> ((y = z -> ph) /\ E.y(y = z /\ ph)))
96, 7, 83bitr4g 555 1 |- (A.x x = y -> ([z / x]ph <-> [z / y]ph))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 954   = wceq 956  E.wex 980  [wsbc 1170
This theorem is referenced by:  sbequi 1228  sbco3 1257  sbcom 1258  sb9i 1263
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172
Copyright terms: Public domain