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

Theorem refsymrel3 39408
Description: A relation which is reflexive and symmetric (like an equivalence relation) can use the 𝑥 ∈ dom 𝑅𝑥𝑅𝑥 version for its reflexive part, not just the 𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) version of dfrefrel3 39352, cf. the comment of dfrefrel3 39352. (Contributed by Peter Mazsa, 23-Aug-2021.)
Assertion
Ref Expression
refsymrel3 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((∀𝑥 ∈ dom 𝑅 𝑥𝑅𝑥 ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ∧ Rel 𝑅))
Distinct variable group:   𝑥,𝑅,𝑦

Proof of Theorem refsymrel3
StepHypRef Expression
1 dfrefrel3 39352 . . . 4 ( RefRel 𝑅 ↔ (∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅))
2 dfsymrel3 39390 . . . 4 ( SymRel 𝑅 ↔ (∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥) ∧ Rel 𝑅))
31, 2anbi12i 640 . . 3 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅) ∧ (∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥) ∧ Rel 𝑅)))
4 anandi3r 1120 . . 3 ((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅 ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ↔ ((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅) ∧ (∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥) ∧ Rel 𝑅)))
5 3anan32 1113 . . 3 ((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅 ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ↔ ((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ∧ Rel 𝑅))
63, 4, 53bitr2i 302 . 2 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ∧ Rel 𝑅))
7 symrefref3 39404 . . . 4 (∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥) → (∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ↔ ∀𝑥 ∈ dom 𝑅 𝑥𝑅𝑥))
87pm5.32ri 586 . . 3 ((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ↔ (∀𝑥 ∈ dom 𝑅 𝑥𝑅𝑥 ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)))
98anbi1i 636 . 2 (((∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ∧ Rel 𝑅) ↔ ((∀𝑥 ∈ dom 𝑅 𝑥𝑅𝑥 ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ∧ Rel 𝑅))
106, 9bitri 278 1 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((∀𝑥 ∈ dom 𝑅 𝑥𝑅𝑥 ∧ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥)) ∧ Rel 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103  wal 1568  wral 3078   class class class wbr 5107  dom cdm 5659  ran crn 5660  Rel wrel 5664   RefRel wrefrel 38945   SymRel wsymrel 38951
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2734  ax-sep 5255  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671  df-refrel 39348  df-symrel 39380
This theorem is used by:  dfeqvrel3  39431
  Copyright terms: Public domain W3C validator