Theorem releleccnv 39332

Description: Elementhood in a converse 𝑅-coset when 𝑅 is a relation. (Contributed by Peter Mazsa, 9-Dec-2018.)

Assertion

Ref	Expression
releleccnv	⊢ (Rel 𝑅 → (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐴𝑅𝐵))

Proof of Theorem releleccnv

Step	Hyp	Ref	Expression
1		relcnv 6105	. . 3 ⊢ Rel ◡𝑅
2		relelec 8776	. . 3 ⊢ (Rel ◡𝑅 → (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐵◡𝑅𝐴))
3	1, 2	ax-mp 5	. 2 ⊢ (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐵◡𝑅𝐴)
4		relbrcnvg 6106	. 2 ⊢ (Rel 𝑅 → (𝐵◡𝑅𝐴 ↔ 𝐴𝑅𝐵))
5	3, 4	bitrid 286	1 ⊢ (Rel 𝑅 → (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐴𝑅𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2146   class class class wbr 5105  ^◡ccnv 5653  Rel wrel 5659  [cec 8726

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-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-xp 5660  df-rel 5661  df-cnv 5662  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ec 8730

This theorem is used by:  releccnveq  39333