Theorem ereq2 6815

Description: Equality theorem for equivalence predicate. (Contributed by Mario Carneiro, 12-Aug-2015.)

Assertion

Ref	Expression
ereq2	⊢ (𝐴 = 𝐵 → (𝑅 Er 𝐴 ↔ 𝑅 Er 𝐵))

Proof of Theorem ereq2

Step	Hyp	Ref	Expression
1		eqeq2 2248	. . 3 ⊢ (𝐴 = 𝐵 → (dom 𝑅 = 𝐴 ↔ dom 𝑅 = 𝐵))
2	1	3anbi2d 1358	. 2 ⊢ (𝐴 = 𝐵 → ((Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅) ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐵 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅)))
3		df-er 6807	. 2 ⊢ (𝑅 Er 𝐴 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅))
4		df-er 6807	. 2 ⊢ (𝑅 Er 𝐵 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐵 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅))
5	2, 3, 4	3bitr4g 223	1 ⊢ (𝐴 = 𝐵 → (𝑅 Er 𝐴 ↔ 𝑅 Er 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∪ cun 3218   ⊆ wss 3220  ^◡ccnv 4773  dom cdm 4774   ∘ ccom 4778  Rel wrel 4779   Er wer 6804

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-gen 1502  ax-4 1563  ax-17 1579  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-cleq 2231  df-er 6807

This theorem is used by:  iserd  6833