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

Theorem dvelim 1352
Description: This theorem can be used to eliminate a distinct variable restriction on x and z and replace it with the "distinctor" -. A.xx = y as an antecedent. ph normally has z free and can be read ph(z), and ps substitutes y for z and can be read ph(y). We don't require that x and y be distinct: if they aren't, the distinctor will become false (in multiple-element domains of discourse) and "protect" the consequent.

To obtain a closed-theorem form of this inference, prefix the hypotheses with A.xA.z, conjoin them, and apply dvelimdf 1251.

Hypotheses
Ref Expression
dvelim.1 |- (ph -> A.xph)
dvelim.2 |- (z = y -> (ph <-> ps))
Assertion
Ref Expression
dvelim |- (-. A.x x = y -> (ps -> A.xps))
Distinct variable group:   ps,z

Proof of Theorem dvelim
StepHypRef Expression
1 dvelim.1 . 2 |- (ph -> A.xph)
2 ax-17 971 . 2 |- (ps -> A.zps)
3 dvelim.2 . 2 |- (z = y -> (ph <-> ps))
41, 2, 3dvelimf 1250 1 |- (-. A.x x = y -> (ps -> A.xps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146  A.wal 954   = wceq 956
This theorem is referenced by:  rgen2a 1699  ralcom2 1776
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-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-11o 1218
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172
Copyright terms: Public domain