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

Theorem cnvrefrelcoss2 37946
Description: Necessary and sufficient condition for a coset relation to be a converse reflexive relation. (Contributed by Peter Mazsa, 27-Jul-2021.)
Assertion
Ref Expression
cnvrefrelcoss2 ( CnvRefRel ≀ 𝑅 ↔ ≀ 𝑅 ⊆ I )

Proof of Theorem cnvrefrelcoss2
StepHypRef Expression
1 relcoss 37832 . . 3 Rel ≀ 𝑅
2 dfcnvrefrel2 37939 . . 3 ( CnvRefRel ≀ 𝑅 ↔ ( ≀ 𝑅 ⊆ ( I ∩ (dom ≀ 𝑅 × ran ≀ 𝑅)) ∧ Rel ≀ 𝑅))
31, 2mpbiran2 709 . 2 ( CnvRefRel ≀ 𝑅 ↔ ≀ 𝑅 ⊆ ( I ∩ (dom ≀ 𝑅 × ran ≀ 𝑅)))
4 cossssid 37876 . 2 ( ≀ 𝑅 ⊆ I ↔ ≀ 𝑅 ⊆ ( I ∩ (dom ≀ 𝑅 × ran ≀ 𝑅)))
53, 4bitr4i 278 1 ( CnvRefRel ≀ 𝑅 ↔ ≀ 𝑅 ⊆ I )
Colors of variables: wff setvar class
Syntax hints:  wb 205  cin 3943  wss 3944   I cid 5569   × cxp 5670  dom cdm 5672  ran crn 5673  Rel wrel 5677  ccoss 37583   CnvRefRel wcnvrefrel 37592
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-br 5143  df-opab 5205  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-coss 37820  df-cnvrefrel 37936
This theorem is referenced by:  dffunALTV2  38097  funALTVfun  38107  dfdisjALTV2  38123
  Copyright terms: Public domain W3C validator