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

Theorem dfrefrel3 38841
Description: Alternate definition of the reflexive relation predicate. A relation is reflexive iff: for all elements on its domain and range, if an element of its domain is the same as an element of its range, then there is the relation between them.

Note that this is definitely not the definition we are accustomed to, like e.g. idref 7101 / idrefALT 6078 or df-reflexive 50121 (𝑅Reflexive𝐴 ↔ (𝑅 ⊆ (𝐴 × 𝐴) ∧ ∀𝑥𝐴𝑥𝑅𝑥)). It turns out that the not-surprising definition which contains 𝑥 ∈ dom 𝑟𝑥𝑟𝑥 needs symmetry as well, see refsymrels3 38895. Only when this symmetry condition holds, like in case of equivalence relations, see dfeqvrels3 38918, can we write the traditional form 𝑥 ∈ dom 𝑟𝑥𝑟𝑥 for reflexive relations. For the special case with square Cartesian product when the two forms are equivalent see idinxpssinxp4 38571 where (∀𝑥𝐴𝑦𝐴(𝑥 = 𝑦𝑥𝑅𝑦) ↔ ∀𝑥𝐴𝑥𝑅𝑥). See also similar definition of the converse reflexive relations class dfcnvrefrel3 38856. (Contributed by Peter Mazsa, 8-Jul-2019.)

Assertion
Ref Expression
dfrefrel3 ( RefRel 𝑅 ↔ (∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅))
Distinct variable group:   𝑥,𝑅,𝑦

Proof of Theorem dfrefrel3
StepHypRef Expression
1 dfrefrel2 38840 . 2 ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
2 idinxpss 38563 . . 3 (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ↔ ∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦))
32anbi1i 625 . 2 ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅) ↔ (∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅))
41, 3bitri 275 1 ( RefRel 𝑅 ↔ (∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦) ∧ Rel 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wral 3052  cin 3902  wss 3903   class class class wbr 5100   I cid 5526   × cxp 5630  dom cdm 5632  ran crn 5633  Rel wrel 5637   RefRel wrefrel 38434
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-dm 5642  df-rn 5643  df-res 5644  df-refrel 38837
This theorem is referenced by:  refsymrel3  38897
  Copyright terms: Public domain W3C validator