Theorem elabd 3643

Description: Explicit demonstration the class {𝑥 ∣ 𝜓} is not empty by the example 𝐴. (Contributed by RP, 12-Aug-2020.) (Revised by AV, 23-Mar-2024.)

Hypotheses

Ref	Expression
elabd.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
elabd.2	⊢ (𝜑 → 𝜒)
elabd.3	⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
elabd	⊢ (𝜑 → 𝐴 ∈ {𝑥 ∣ 𝜓})

Distinct variable groups:   𝑥,𝐴   𝜒,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)   𝑉(𝑥)

Proof of Theorem elabd

Step	Hyp	Ref	Expression
1		elabd.2	. 2 ⊢ (𝜑 → 𝜒)
2		elabd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
3		elabd.3	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜒))
4	3	elabg 3638	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝑥 ∣ 𝜓} ↔ 𝜒))
5	2, 4	syl 18	. 2 ⊢ (𝜑 → (𝐴 ∈ {𝑥 ∣ 𝜓} ↔ 𝜒))
6	1, 5	mpbird 260	1 ⊢ (𝜑 → 𝐴 ∈ {𝑥 ∣ 𝜓})

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

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 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841

This theorem is used by:  intidg  5443  lubval  18435  glbval  18448  sursubmefmnd  18986  injsubmefmnd  18987  nosupfv  27907  branmfn  32494  orvcval  34880  r1peuqusdeg1  36156  sticksstones3  42956  rngunsnply  43937  hoidmvlelem1  47350  cfsetsnfsetf  47836  iinfconstbaslem  49884