Theorem elrefsymrelsrel 38112

Description: For sets, being an element of the class of reflexive and symmetric relations is equivalent to satisfying the reflexive and symmetric relation predicates. (Contributed by Peter Mazsa, 23-Aug-2021.)

Assertion

Ref	Expression
elrefsymrelsrel	⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ ( RefRels ∩ SymRels ) ↔ ( RefRel 𝑅 ∧ SymRel 𝑅)))

Proof of Theorem elrefsymrelsrel

Step	Hyp	Ref	Expression
1		elin 3961	. 2 ⊢ (𝑅 ∈ ( RefRels ∩ SymRels ) ↔ (𝑅 ∈ RefRels ∧ 𝑅 ∈ SymRels ))
2		elrefrelsrel 38061	. . 3 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ RefRels ↔ RefRel 𝑅))
3		elsymrelsrel 38098	. . 3 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ SymRels ↔ SymRel 𝑅))
4	2, 3	anbi12d 630	. 2 ⊢ (𝑅 ∈ 𝑉 → ((𝑅 ∈ RefRels ∧ 𝑅 ∈ SymRels ) ↔ ( RefRel 𝑅 ∧ SymRel 𝑅)))
5	1, 4	bitrid 282	1 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ ( RefRels ∩ SymRels ) ↔ ( RefRel 𝑅 ∧ SymRel 𝑅)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∈ wcel 2098   ∩ cin 3944   RefRels crefrels 37723   RefRel wrefrel 37724   SymRels csymrels 37729   SymRel wsymrel 37730

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696  ax-sep 5299  ax-nul 5306  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3465  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-br 5149  df-opab 5211  df-xp 5683  df-rel 5684  df-cnv 5685  df-dm 5687  df-rn 5688  df-res 5689  df-rels 38026  df-ssr 38039  df-refs 38051  df-refrels 38052  df-refrel 38053  df-syms 38083  df-symrels 38084  df-symrel 38085

This theorem is referenced by: (None)