Theorem rexanali 3092

Description: A transformation of restricted quantifiers and logical connectives. (Contributed by NM, 4-Sep-2005.) (Proof shortened by Wolf Lammen, 27-Dec-2019.)

Assertion

Ref	Expression
rexanali	⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓))

Proof of Theorem rexanali

Step	Hyp	Ref	Expression
1		dfrex2 3065	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜓))
2		iman 401	. . 3 ⊢ ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓))
3	2	ralbii 3084	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜓))
4	1, 3	xchbinxr 335	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∀wral 3052  ∃wrex 3062

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782  df-ral 3053  df-rex 3063

This theorem is referenced by:  nrexralim  3122  ceqsralbv  3613  frpoind  6308  frind  9674  qsqueeze  13128  ncoprmgcdne1b  16589  elcls  23029  ist1-2  23303  haust1  23308  t1sep  23326  bwth  23366  1stccnp  23418  filufint  23876  fclscf  23981  pmltpc  25419  ovolgelb  25449  itg2seq  25711  radcnvlt1  26395  pntlem3  27588  nosupbnd1lem5  27692  noinfbnd1lem5  27707  oncutlt  28272  umgr2edg1  29296  umgr2edgneu  29299  archiabl  33291  extdgfialglem1  33869  ordtconnlem1  34101  limsucncmpi  36658  matunitlindflem1  37864  ftc1anclem5  37945  clsk3nimkb  44393