Theorem rexanali 3125

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 3098	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜓))
2		iman 406	. . 3 ⊢ ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓))
3	2	ralbii 3117	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜓))
4	1, 3	xchbinxr 338	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wral 3085  ∃wrex 3095

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

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1807  df-ral 3086  df-rex 3096

This theorem is referenced by:  nrexralim  3155  ceqsralbv  3625  frpoind  6340  frind  9718  qsqueeze  13223  ncoprmgcdne1b  16704  elcls  23195  ist1-2  23469  haust1  23474  t1sep  23492  bwth  23532  1stccnp  23584  filufint  24042  fclscf  24147  pmltpc  25574  ovolgelb  25604  itg2seq  25866  radcnvlt1  26543  pntlem3  27735  nosupbnd1lem5  27838  noinfbnd1lem5  27853  oncutlt  28419  umgr2edg1  29498  umgr2edgneu  29501  archiabl  33455  extdgfialglem1  34023  ordtconnlem1  34255  limsucncmpi  36841  matunitlindflem1  38150  ftc1anclem5  38231  clsk3nimkb  44651