Theorem dfsymrel2 39659

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 39650	. 2 ⊢ ( SymRel 𝑅 ↔ (◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
2		dfrel6 39373	. . . . . 6 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
3	2	biimpi 219	. . . . 5 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
4	3	cnveqd 5852	. . . 4 ⊢ (Rel 𝑅 → ◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) = ◡𝑅)
5	4, 3	sseq12d 3941	. . 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 1569   ⊆ wss 3895   ∩ cin 4089   × cxp 5648  ^◡ccnv 5649  dom cdm 5650  ran crn 5651  Rel wrel 5655   SymRel wsymrel 39221

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-symrel 39650

This theorem is used by:  dfsymrel3  39660  dfsymrel4  39661  dfsymrel5  39662  elsymrelsrel  39667  symreleq  39668  symrelcoss  39670  refsymrel2  39677  eqvrelsym  39715  refrelredund4  39745