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

Theorem refsymrel2 39786
Description: A relation which is reflexive and symmetric (like an equivalence relation) can use the restricted version for their reflexive part (see below), not just the ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 version of dfrefrel2 39730, cf. the comment of dfrefrels2 39728. (Contributed by Peter Mazsa, 23-Aug-2021.)
Assertion
Ref Expression
refsymrel2 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅))

Proof of Theorem refsymrel2
StepHypRef Expression
1 dfrefrel2 39730 . . . 4 ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
2 dfsymrel2 39768 . . . 4 ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅))
31, 2anbi12i 640 . . 3 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅) ∧ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)))
4 anandi3r 1120 . . 3 ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ↔ ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅) ∧ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)))
5 3anan32 1113 . . 3 ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ↔ ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅))
63, 4, 53bitr2i 302 . 2 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅))
7 symrefref2 39782 . . . 4 (◡𝑅 ⊆ 𝑅 → (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ↔ ( I ↾ dom 𝑅) ⊆ 𝑅))
87pm5.32ri 586 . . 3 ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ↔ (( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅))
98anbi1i 636 . 2 (((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅))
106, 9bitri 278 1 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ⊆ wss 3900   ∩ cin 4092   I cid 5550   × cxp 5654  ◡ccnv 5655  dom cdm 5656  ran crn 5657   ↾ cres 5658  Rel wrel 5661   RefRel wrefrel 39324   SymRel wsymrel 39330
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-dm 5666  df-rn 5667  df-res 5668  df-refrel 39727  df-symrel 39759
This theorem is used by:  dfeqvrel2  39809  refrelredund4  39854
  Copyright terms: Public domain W3C validator