Theorem releleccnv 39458

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 6118	. . 3 ⊢ Rel ◡𝑅
2		relelec 8803	. . 3 ⊢ (Rel ◡𝑅 → (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐵◡𝑅𝐴))
3	1, 2	ax-mp 5	. 2 ⊢ (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐵◡𝑅𝐴)
4		relbrcnvg 6119	. 2 ⊢ (Rel 𝑅 → (𝐵◡𝑅𝐴 ↔ 𝐴𝑅𝐵))
5	3, 4	bitrid 286	1 ⊢ (Rel 𝑅 → (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐴𝑅𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2147   class class class wbr 5108  ^◡ccnv 5657  Rel wrel 5663  [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-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-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:  releccnveq  39459