Theorem dfrefrel2 36319

Description: Alternate definition of the reflexive relation predicate. (Contributed by Peter Mazsa, 25-Jul-2021.)

Assertion

Ref	Expression
dfrefrel2	⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))

Proof of Theorem dfrefrel2

Step	Hyp	Ref	Expression
1		df-refrel 36316	. 2 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
2		dfrel6 36168	. . . . 5 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
3	2	biimpi 219	. . . 4 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
4	3	sseq2d 3919	. . 3 ⊢ (Rel 𝑅 → (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ↔ ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅))
5	4	pm5.32ri 579	. 2 ⊢ ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅) ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
6	1, 5	bitri 278	1 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))

Syntax hints:   ↔ wb 209   ∧ wa 399   = wceq 1543   ∩ cin 3852   ⊆ wss 3853   I cid 5439   × cxp 5534  dom cdm 5536  ran crn 5537  Rel wrel 5541   RefRel wrefrel 36025

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-clab 2715  df-cleq 2728  df-clel 2809  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-br 5040  df-opab 5102  df-xp 5542  df-rel 5543  df-cnv 5544  df-dm 5546  df-rn 5547  df-res 5548  df-refrel 36316

This theorem is referenced by:  dfrefrel3  36320  elrefrelsrel  36323  refreleq  36324  refrelcoss  36326  refsymrel2  36367  refrelredund4  36434