Theorem rexanali 3090

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 3063	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜓))
2		iman 401	. . 3 ⊢ ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓))
3	2	ralbii 3082	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜓))
4	1, 3	xchbinxr 335	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓))

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

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

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781  df-ral 3052  df-rex 3061

This theorem is referenced by:  nrexralim  3120  ceqsralbv  3611  frpoind  6300  frind  9662  qsqueeze  13116  ncoprmgcdne1b  16577  elcls  23017  ist1-2  23291  haust1  23296  t1sep  23314  bwth  23354  1stccnp  23406  filufint  23864  fclscf  23969  pmltpc  25407  ovolgelb  25437  itg2seq  25699  radcnvlt1  26383  pntlem3  27576  nosupbnd1lem5  27680  noinfbnd1lem5  27695  oncutlt  28260  umgr2edg1  29284  umgr2edgneu  29287  archiabl  33280  extdgfialglem1  33849  ordtconnlem1  34081  limsucncmpi  36639  matunitlindflem1  37817  ftc1anclem5  37898  clsk3nimkb  44281