Theorem ralinexa 2351

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 624	. . 3 |- ( ( ph -> -. ps ) <-> -. ( ph /\ ps ) )
2	1	ralbii 2330	. 2 |- ( A. x e. A ( ph -> -. ps ) <-> A. x e. A -. ( ph /\ ps ) )
3		ralnex 2316	. 2 |- ( A. x e. A -. ( ph /\ ps ) <-> -. E. x e. A ( ph /\ ps ) )
4	2, 3	bitri 173	1 |- ( A. x e. A ( ph -> -. ps ) <-> -. E. x e. A ( ph /\ ps ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 97   <-> wb 98   A.wral 2306   E.wrex 2307

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-5 1336  ax-gen 1338  ax-ie2 1383  ax-4 1400  ax-17 1419

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-fal 1249  df-nf 1350  df-ral 2311  df-rex 2312

This theorem is referenced by: (None)