Theorem elrelscnveq 38883

Description: Two ways of saying a relation is symmetric. (Contributed by Peter Mazsa, 22-Aug-2021.)

Assertion

Ref	Expression
elrelscnveq	⊢ (𝑅 ∈ Rels → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑅 = 𝑅))

Proof of Theorem elrelscnveq

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elrelscnveq3 38882	. . 3 ⊢ (𝑅 ∈ Rels → (𝑅 = ◡𝑅 ↔ ∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝑦𝑅𝑥)))
2		cnvsym 6079	. . 3 ⊢ (◡𝑅 ⊆ 𝑅 ↔ ∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝑦𝑅𝑥))
3	1, 2	bitr4di 289	. 2 ⊢ (𝑅 ∈ Rels → (𝑅 = ◡𝑅 ↔ ◡𝑅 ⊆ 𝑅))
4		eqcom 2744	. 2 ⊢ (𝑅 = ◡𝑅 ↔ ◡𝑅 = 𝑅)
5	3, 4	bitr3di 286	1 ⊢ (𝑅 ∈ Rels → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑅 = 𝑅))

Syntax hints:   → wi 4   ↔ wb 206  ∀wal 1540   = wceq 1542   ∈ wcel 2114   ⊆ wss 3903   class class class wbr 5100  ^◡ccnv 5631   Rels crels 38440

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-xp 5638  df-rel 5639  df-cnv 5640  df-rels 38695

This theorem is referenced by:  elrelscnveq4  38885  dfsymrels4  38886