Theorem eccnvepres3 39490

Description: Condition for a restricted converse epsilon coset of a set to be the set itself. (Contributed by Peter Mazsa, 11-May-2021.)

Assertion

Ref	Expression
eccnvepres3	⊢ (𝐵 ∈ dom (◡ E ↾ 𝐴) → [𝐵](◡ E ↾ 𝐴) = 𝐵)

Proof of Theorem eccnvepres3

Step	Hyp	Ref	Expression
1		resdmres 6252	. . 3 ⊢ (◡ E ↾ dom (◡ E ↾ 𝐴)) = (◡ E ↾ 𝐴)
2	1	eceq2i 8798	. 2 ⊢ [𝐵](◡ E ↾ dom (◡ E ↾ 𝐴)) = [𝐵](◡ E ↾ 𝐴)
3		eccnvepres2 39489	. 2 ⊢ (𝐵 ∈ dom (◡ E ↾ 𝐴) → [𝐵](◡ E ↾ dom (◡ E ↾ 𝐴)) = 𝐵)
4	2, 3	eqtr3id 2812	1 ⊢ (𝐵 ∈ dom (◡ E ↾ 𝐴) → [𝐵](◡ E ↾ 𝐴) = 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   E cep 5557  ^◡ccnv 5657  dom cdm 5658   ↾ cres 5660  [cec 8753

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-eprel 5558  df-xp 5664  df-rel 5665  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ec 8757

This theorem is used by:  eldisjlem19  40111