Theorem ecref 8747

Description: All elements are in their own equivalence class. (Contributed by Thierry Arnoux, 14-Feb-2025.)

Assertion

Ref	Expression
ecref	⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ [𝐴]𝑅)

Proof of Theorem ecref

Step	Hyp	Ref	Expression
1		simpl 488	. . 3 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝑅 Er 𝑋)
2		simpr 490	. . 3 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
3	1, 2	erref 8722	. 2 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴𝑅𝐴)
4		elecg 8746	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴))
5	2, 4	sylancom 600	. 2 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴))
6	3, 5	mpbird 260	1 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ [𝐴]𝑅)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145   class class class wbr 5103   Er wer 8698  [cec 8699

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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-er 8701  df-ec 8703

This theorem is used by:  ghmqusnsglem1  19474  ghmqusnsglem2  19475  ghmquskerlem1  19477  ghmquskerlem2  19479  qsdrnglem2  34002