Theorem alinexa 1651

Description: A transformation of quantifiers and logical connectives. (Contributed by NM, 19-Aug-1993.)

Assertion

Ref	Expression
alinexa	|- ( A. x ( ph -> -. ps ) <-> -. E. x ( ph /\ ps ) )

Proof of Theorem alinexa

Step	Hyp	Ref	Expression
1		imnan 696	. . 3 |- ( ( ph -> -. ps ) <-> -. ( ph /\ ps ) )
2	1	albii 1518	. 2 |- ( A. x ( ph -> -. ps ) <-> A. x -. ( ph /\ ps ) )
3		alnex 1547	. 2 |- ( A. x -. ( ph /\ ps ) <-> -. E. x ( ph /\ ps ) )
4	2, 3	bitri 184	1 |- ( A. x ( ph -> -. ps ) <-> -. E. x ( ph /\ ps ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   A.wal 1395   E.wex 1540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-5 1495  ax-gen 1497  ax-ie2 1542

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-fal 1403

This theorem is referenced by:  sbnv  1937  ralnex  2520