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  3600  frpoind  6300  frind  9665  qsqueeze  13144  ncoprmgcdne1b  16610  elcls  23048  ist1-2  23322  haust1  23327  t1sep  23345  bwth  23385  1stccnp  23437  filufint  23895  fclscf  24000  pmltpc  25427  ovolgelb  25457  itg2seq  25719  radcnvlt1  26396  pntlem3  27586  nosupbnd1lem5  27690  noinfbnd1lem5  27705  oncutlt  28270  umgr2edg1  29294  umgr2edgneu  29297  archiabl  33274  extdgfialglem1  33852  ordtconnlem1  34084  limsucncmpi  36643  matunitlindflem1  37951  ftc1anclem5  38032  clsk3nimkb  44485