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

Theorem dfcnvrefrel4 39049
Description: Alternate definition of the converse reflexive relation predicate. (Contributed by Peter Mazsa, 25-May-2024.)
Assertion
Ref Expression
dfcnvrefrel4 ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ I ∧ Rel 𝑅))

Proof of Theorem dfcnvrefrel4
StepHypRef Expression
1 df-cnvrefrel 39044 . 2 ( CnvRefRel 𝑅 ↔ ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
2 cnvref4 38787 . 2 (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ↔ 𝑅 ⊆ I ))
31, 2bianim 583 1 ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ I ∧ Rel 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  cin 3894  wss 3895   I cid 5530   × cxp 5634  dom cdm 5636  ran crn 5637  Rel wrel 5641   CnvRefRel wcnvrefrel 38629
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-ext 2724  ax-sep 5236  ax-pr 5380
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-sb 2081  df-clab 2731  df-cleq 2744  df-clel 2827  df-ral 3067  df-rex 3077  df-rab 3405  df-v 3446  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-sn 4573  df-pr 4575  df-op 4579  df-br 5091  df-opab 5153  df-xp 5642  df-rel 5643  df-cnv 5644  df-dm 5646  df-rn 5647  df-res 5648  df-cnvrefrel 39044
This theorem is referenced by:  dfcnvrefrel5  39050  dfantisymrel4  39301
  Copyright terms: Public domain W3C validator