Theorem elab2gw 3639

Description: Membership in a class abstraction, using two substitution hypotheses to avoid a disjoint variable condition on 𝑥 and 𝐴, which is not usually significant since 𝐵 is usually a constant. (Contributed by SN, 16-May-2024.)

Hypotheses

Ref	Expression
elabgw.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
elabgw.2	⊢ (𝑦 = 𝐴 → (𝜓 ↔ 𝜒))
elab2gw.3	⊢ 𝐵 = {𝑥 ∣ 𝜑}

Assertion

Ref	Expression
elab2gw	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ 𝜒))

Distinct variable groups:   𝑦,𝐴   𝑥,𝑦   𝜑,𝑦   𝜒,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑥)   𝐴(𝑥)   𝐵(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem elab2gw

Step	Hyp	Ref	Expression
1		elab2gw.3	. . 3 ⊢ 𝐵 = {𝑥 ∣ 𝜑}
2	1	eleq2i 2857	. 2 ⊢ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ {𝑥 ∣ 𝜑})
3		elabgw.1	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4		elabgw.2	. . 3 ⊢ (𝑦 = 𝐴 → (𝜓 ↔ 𝜒))
5	3, 4	elabgw 3638	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜒))
6	2, 5	bitrid 286	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146  {cab 2743

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840

This theorem is used by:  elrab2w  3657