Theorem dfrefrel2 38916

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 38913	. 2 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
2		dfrel6 38668	. . . . 5 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
3	2	biimpi 216	. . . 4 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
4	3	sseq2d 3954	. . 3 ⊢ (Rel 𝑅 → (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ↔ ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅))
5	4	pm5.32ri 575	. 2 ⊢ ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅) ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
6	1, 5	bitri 275	1 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1542   ∩ cin 3888   ⊆ wss 3889   I cid 5525   × cxp 5629  dom cdm 5631  ran crn 5632  Rel wrel 5636   RefRel wrefrel 38510

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 2708  ax-sep 5231  ax-pr 5375

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 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-cnv 5639  df-dm 5641  df-rn 5642  df-res 5643  df-refrel 38913

This theorem is referenced by:  dfrefrel3  38917  dfrefrel5  38918  elrefrelsrel  38921  refreleq  38922  refrelcoss  38924  refsymrel2  38972  refrelredund4  39040