Theorem ralinexa 2497

Description: A transformation of restricted quantifiers and logical connectives. (Contributed by NM, 4-Sep-2005.)

Assertion

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

Proof of Theorem ralinexa

Step	Hyp	Ref	Expression
1		imnan 685	. . 3 |- ( ( ph -> -. ps ) <-> -. ( ph /\ ps ) )
2	1	ralbii 2476	. 2 |- ( A. x e. A ( ph -> -. ps ) <-> A. x e. A -. ( ph /\ ps ) )
3		ralnex 2458	. 2 |- ( A. x e. A -. ( ph /\ ps ) <-> -. E. x e. A ( ph /\ ps ) )
4	2, 3	bitri 183	1 |- ( A. x e. A ( ph -> -. ps ) <-> -. E. x e. A ( ph /\ ps ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   A.wral 2448   E.wrex 2449

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-5 1440  ax-gen 1442  ax-ie2 1487  ax-4 1503  ax-17 1519

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-fal 1354  df-nf 1454  df-ral 2453  df-rex 2454

This theorem is referenced by:  ntreq0  12926