Metamath Proof Explorer


Theorem dedth2h

Description: Weak deduction theorem eliminating two hypotheses. This theorem is simpler to use than dedth2v but requires that each hypothesis have exactly one class variable. See also comments in dedth . (Contributed by NM, 15-May-1999)

Ref Expression
Hypotheses dedth2h.1 A=ifφACχθ
dedth2h.2 B=ifψBDθτ
dedth2h.3 τ
Assertion dedth2h φψχ

Proof

Step Hyp Ref Expression
1 dedth2h.1 A=ifφACχθ
2 dedth2h.2 B=ifψBDθτ
3 dedth2h.3 τ
4 1 imbi2d A=ifφACψχψθ
5 2 3 dedth ψθ
6 4 5 dedth φψχ
7 6 imp φψχ