Theorem ralinexa 2560

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 697	. . 3 |- ( ( ph -> -. ps ) <-> -. ( ph /\ ps ) )
2	1	ralbii 2539	. 2 |- ( A. x e. A ( ph -> -. ps ) <-> A. x e. A -. ( ph /\ ps ) )
3		ralnex 2521	. 2 |- ( A. x e. A -. ( ph /\ ps ) <-> -. E. x e. A ( ph /\ ps ) )
4	2, 3	bitri 184	1 |- ( A. x e. A ( ph -> -. ps ) <-> -. E. x e. A ( ph /\ ps ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   A.wral 2511   E.wrex 2512

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 1496  ax-gen 1498  ax-ie2 1543  ax-4 1559  ax-17 1575

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-ral 2516  df-rex 2517

This theorem is referenced by:  ntreq0  14943