Theorem dfsymrel2 39310

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 39301	. 2 ⊢ ( SymRel 𝑅 ↔ (◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
2		dfrel6 39024	. . . . . 6 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
3	2	biimpi 219	. . . . 5 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
4	3	cnveqd 5861	. . . 4 ⊢ (Rel 𝑅 → ◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) = ◡𝑅)
5	4, 3	sseq12d 3970	. . 3 ⊢ (Rel 𝑅 → (◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ↔ ◡𝑅 ⊆ 𝑅))
6	5	pm5.32ri 585	. 2 ⊢ ((◡(𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅) ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅))
7	1, 6	bitri 278	1 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400   = wceq 1570   ∩ cin 3904   ⊆ wss 3905   × cxp 5659  ^◡ccnv 5660  dom cdm 5661  ran crn 5662  Rel wrel 5666   SymRel wsymrel 38872

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-dm 5671  df-rn 5672  df-res 5673  df-symrel 39301

This theorem is used by:  dfsymrel3  39311  dfsymrel4  39312  dfsymrel5  39313  elsymrelsrel  39318  symreleq  39319  symrelcoss  39321  refsymrel2  39328  eqvrelsym  39366  refrelredund4  39396