Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elrefrelsrel Structured version   Visualization version   GIF version

Theorem elrefrelsrel 36637
Description: For sets, being an element of the class of reflexive relations (df-refrels 36629) is equivalent to satisfying the reflexive relation predicate. (Contributed by Peter Mazsa, 25-Jul-2021.)
Assertion
Ref Expression
elrefrelsrel (𝑅𝑉 → (𝑅 ∈ RefRels ↔ RefRel 𝑅))

Proof of Theorem elrefrelsrel
StepHypRef Expression
1 elrelsrel 36605 . . 3 (𝑅𝑉 → (𝑅 ∈ Rels ↔ Rel 𝑅))
21anbi2d 629 . 2 (𝑅𝑉 → ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅𝑅 ∈ Rels ) ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅)))
3 elrefrels2 36635 . 2 (𝑅 ∈ RefRels ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅𝑅 ∈ Rels ))
4 dfrefrel2 36633 . 2 ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
52, 3, 43bitr4g 314 1 (𝑅𝑉 → (𝑅 ∈ RefRels ↔ RefRel 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wcel 2106  cin 3886  wss 3887   I cid 5488   × cxp 5587  dom cdm 5589  ran crn 5590  Rel wrel 5594   Rels crels 36335   RefRels crefrels 36338   RefRel wrefrel 36339
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601  df-rels 36603  df-ssr 36616  df-refs 36628  df-refrels 36629  df-refrel 36630
This theorem is referenced by:  elrefsymrelsrel  36685
  Copyright terms: Public domain W3C validator