Theorem dfcnvrefrel2 38813

Description: Alternate definition of the converse reflexive relation predicate. (Contributed by Peter Mazsa, 24-Jul-2019.)

Assertion

Ref	Expression
dfcnvrefrel2	⊢ ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))

Proof of Theorem dfcnvrefrel2

Step	Hyp	Ref	Expression
1		df-cnvrefrel 38810	. 2 ⊢ ( CnvRefRel 𝑅 ↔ ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
2		dfrel6 38550	. . . . 5 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
3	2	biimpi 216	. . . 4 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅)
4	3	sseq1d 3966	. . 3 ⊢ (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ↔ 𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅))))
5	4	pm5.32ri 575	. 2 ⊢ (((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅) ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))
6	1, 5	bitri 275	1 ⊢ ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1542   ∩ cin 3901   ⊆ wss 3902   I cid 5519   × cxp 5623  dom cdm 5625  ran crn 5626  Rel wrel 5630   CnvRefRel wcnvrefrel 38395

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 5242  ax-nul 5252  ax-pr 5378

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-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-xp 5631  df-rel 5632  df-cnv 5633  df-dm 5635  df-rn 5636  df-res 5637  df-cnvrefrel 38810

This theorem is referenced by:  elcnvrefrelsrel  38819  cnvrefrelcoss2  38820