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 39551
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 39495, cf. the comment of dfrefrels2 39493. (Contributed by Peter Mazsa, 23-Aug-2021.)
Assertion
Ref Expression
refsymrel2 (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅))

Proof of Theorem refsymrel2
StepHypRef Expression
1 dfrefrel2 39495 . . . 4 ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
2 dfsymrel2 39533 . . . 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 39547 . . . 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   ∩ cin 3898   ⊆ wss 3899   I cid 5545   × cxp 5649  ◡ccnv 5650  dom cdm 5651  ran crn 5652   ↾ cres 5653  Rel wrel 5656   RefRel wrefrel 39089   SymRel wsymrel 39095
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-ext 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-refrel 39492  df-symrel 39524
This theorem is used by:  dfeqvrel2  39574  refrelredund4  39619
  Copyright terms: Public domain W3C validator