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 38472
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 7180 / idrefALT 6143 or df-reflexive 48860 (𝑅Reflexive𝐴 ↔ (𝑅 ⊆ (𝐴 × 𝐴) ∧ ∀𝑥𝐴𝑥𝑅𝑥)). It turns out that the not-surprising definition which contains 𝑥 ∈ dom 𝑟𝑥𝑟𝑥 needs symmetry as well, see refsymrels3 38522. Only when this symmetry condition holds, like in case of equivalence relations, see dfeqvrels3 38545, 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 38276 where (∀𝑥𝐴𝑦𝐴(𝑥 = 𝑦𝑥𝑅𝑦) ↔ ∀𝑥𝐴𝑥𝑅𝑥). See also similar definition of the converse reflexive relations class dfcnvrefrel3 38487. (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 38471 . 2 ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
2 idinxpss 38268 . . 3 (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ↔ ∀𝑥 ∈ dom 𝑅𝑦 ∈ ran 𝑅(𝑥 = 𝑦𝑥𝑅𝑦))
32anbi1i 623 . 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 3067  cin 3975  wss 3976   class class class wbr 5166   I cid 5592   × cxp 5698  dom cdm 5700  ran crn 5701  Rel wrel 5705   RefRel wrefrel 38141
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-dm 5710  df-rn 5711  df-res 5712  df-refrel 38468
This theorem is referenced by:  refsymrel3  38524
  Copyright terms: Public domain W3C validator