Theorem eqvrelthi 39769

Description: Basic property of equivalence relations. Part of Lemma 3N of [Enderton] p. 57. (Contributed by NM, 30-Jul-1995.) (Revised by Mario Carneiro, 9-Jul-2014.) (Revised by Peter Mazsa, 2-Jun-2019.)

Hypotheses

Ref	Expression
eqvrelthi.1	⊢ (𝜑 → EqvRel 𝑅)
eqvrelthi.2	⊢ (𝜑 → 𝐴𝑅𝐵)

Assertion

Ref	Expression
eqvrelthi	⊢ (𝜑 → [𝐴]𝑅 = [𝐵]𝑅)

Proof of Theorem eqvrelthi

Step	Hyp	Ref	Expression
1		eqvrelthi.2	. 2 ⊢ (𝜑 → 𝐴𝑅𝐵)
2		eqvrelthi.1	. . 3 ⊢ (𝜑 → EqvRel 𝑅)
3	2, 1	eqvrelcl 39768	. . 3 ⊢ (𝜑 → 𝐴 ∈ dom 𝑅)
4	2, 3	eqvrelth 39767	. 2 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ [𝐴]𝑅 = [𝐵]𝑅))
5	1, 4	mpbid 235	1 ⊢ (𝜑 → [𝐴]𝑅 = [𝐵]𝑅)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   class class class wbr 5105  [cec 8726   EqvRel weqvrel 39272

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ec 8730  df-refrel 39664  df-symrel 39696  df-trrel 39730  df-eqvrel 39741

This theorem is used by:  eqvreldisj  39770  eqvrelqsel  39772