Theorem rexanid 3111

Description: Cancellation law for restricted existential quantification. (Contributed by Peter Mazsa, 24-May-2018.) (Proof shortened by Wolf Lammen, 8-Jul-2023.)

Assertion

Ref	Expression
rexanid	⊢ (∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐴 𝜑)

Proof of Theorem rexanid

Step	Hyp	Ref	Expression
1		ibar 536	. . 3 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))
2	1	bicomd 225	. 2 ⊢ (𝑥 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ 𝜑))
3	2	rexbiia 3107	1 ⊢ (∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐴 𝜑)

Syntax hints:   ↔ wb 208   ∧ wa 399   ∈ wcel 2142  ∃wrex 3086

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

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1800  df-rex 3087

This theorem is referenced by:  zfrep6  5239  bj-rep  37555  dmqsblocks  39463  sn-axrep5v  42833