Theorem elcnvrefrelsrel 39293

Description: For sets, being an element of the class of converse reflexive relations (df-cnvrefrels 39283) is equivalent to satisfying the converse reflexive relation predicate. (Contributed by Peter Mazsa, 25-Jul-2021.)

Assertion

Ref	Expression
elcnvrefrelsrel	⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ CnvRefRels ↔ CnvRefRel 𝑅))

Proof of Theorem elcnvrefrelsrel

Step	Hyp	Ref	Expression
1		elrelsrel 39119	. . 3 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ Rels ↔ Rel 𝑅))
2	1	anbi2d 641	. 2 ⊢ (𝑅 ∈ 𝑉 → ((𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ 𝑅 ∈ Rels ) ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅)))
3		elcnvrefrels2 39291	. 2 ⊢ (𝑅 ∈ CnvRefRels ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ 𝑅 ∈ Rels ))
4		dfcnvrefrel2 39287	. 2 ⊢ ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
5	2, 3, 4	3bitr4g 317	1 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ CnvRefRels ↔ CnvRefRel 𝑅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∈ wcel 2142   ∩ cin 3903   ⊆ wss 3904   I cid 5554   × cxp 5658  dom cdm 5660  ran crn 5661  Rel wrel 5665   Rels crels 38862   CnvRefRels ccnvrefrels 38868   CnvRefRel wcnvrefrel 38869

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-cnv 5668  df-dm 5670  df-rn 5671  df-res 5672  df-rels 39117  df-ssr 39255  df-cnvrefs 39282  df-cnvrefrels 39283  df-cnvrefrel 39284

This theorem is used by:  elfunsALTVfunALTV  39459  eldisjsdisj  39501