Theorem dfsymrel2 39381

Description: Alternate definition of the symmetric relation predicate. (Contributed by Peter Mazsa, 19-Apr-2019.) (Revised by Peter Mazsa, 17-Aug-2021.)

Assertion

Ref	Expression
dfsymrel2	⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅))

Proof of Theorem dfsymrel2

Step	Hyp	Ref	Expression
1		df-symrel 39372	. 2 ⊢ ( SymRel 𝑅 ↔ (◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
2		dfrel6 39095	. . . . . 6 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
3	2	biimpi 219	. . . . 5 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
4	3	cnveqd 5855	. . . 4 ⊢ (Rel 𝑅 → ◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) = ◡𝑅)
5	4, 3	sseq12d 3964	. . 3 ⊢ (Rel 𝑅 → (◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ↔ ◡𝑅 ⊆ 𝑅))
6	5	pm5.32ri 586	. 2 ⊢ ((◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅) ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅))
7	1, 6	bitri 278	1 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∩ cin 3898   ⊆ wss 3899   × cxp 5653  ^◡ccnv 5654  dom cdm 5655  ran crn 5656  Rel wrel 5660   SymRel wsymrel 38943

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 2732  ax-sep 5251  ax-pr 5398

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 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-symrel 39372

This theorem is used by:  dfsymrel3  39382  dfsymrel4  39383  dfsymrel5  39384  elsymrelsrel  39389  symreleq  39390  symrelcoss  39392  refsymrel2  39399  eqvrelsym  39437  refrelredund4  39467