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 38773
Description: For sets, being an element of the class of reflexive relations (df-refrels 38764) 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 38627 . . 3 (𝑅𝑉 → (𝑅 ∈ Rels ↔ Rel 𝑅))
21anbi2d 630 . 2 (𝑅𝑉 → ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅𝑅 ∈ Rels ) ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅)))
3 elrefrels2 38771 . 2 (𝑅 ∈ RefRels ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅𝑅 ∈ Rels ))
4 dfrefrel2 38768 . 2 ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
52, 3, 43bitr4g 314 1 (𝑅𝑉 → (𝑅 ∈ RefRels ↔ RefRel 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wcel 2113  cin 3900  wss 3901   I cid 5518   × cxp 5622  dom cdm 5624  ran crn 5625  Rel wrel 5629   Rels crels 38385   RefRels crefrels 38388   RefRel wrefrel 38389
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-xp 5630  df-rel 5631  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-rels 38625  df-ssr 38751  df-refs 38763  df-refrels 38764  df-refrel 38765
This theorem is referenced by:  elrefsymrelsrel  38828
  Copyright terms: Public domain W3C validator