Theorem dfcnvrefrels2 39731

Description: Alternate definition of the class of converse reflexive relations. See the comment of dfrefrels2 39716. (Contributed by Peter Mazsa, 21-Jul-2021.)

Assertion

Ref	Expression
dfcnvrefrels2	⊢ CnvRefRels = {𝑟 ∈ Rels ∣ 𝑟 ⊆ ( I ∩ (dom 𝑟 × ran 𝑟))}

Proof of Theorem dfcnvrefrels2

Step	Hyp	Ref	Expression
1		df-cnvrefrels 39729	. 2 ⊢ CnvRefRels = ( CnvRefs ∩ Rels )
2		df-cnvrefs 39728	. 2 ⊢ CnvRefs = {𝑟 ∣ ( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟))}
3		dmexg 7934	. . . . . 6 ⊢ (𝑟 ∈ V → dom 𝑟 ∈ V)
4	3	elv 3459	. . . . 5 ⊢ dom 𝑟 ∈ V
5		rnexg 7935	. . . . . 6 ⊢ (𝑟 ∈ V → ran 𝑟 ∈ V)
6	5	elv 3459	. . . . 5 ⊢ ran 𝑟 ∈ V
7	4, 6	xpex 7788	. . . 4 ⊢ (dom 𝑟 × ran 𝑟) ∈ V
8		inex2g 5284	. . . 4 ⊢ ((dom 𝑟 × ran 𝑟) ∈ V → ( I ∩ (dom 𝑟 × ran 𝑟)) ∈ V)
9		brcnvssr 39709	. . . 4 ⊢ (( I ∩ (dom 𝑟 × ran 𝑟)) ∈ V → (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟))))
10	7, 8, 9	mp2b 10	. . 3 ⊢ (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟)))
11		elrels6 39568	. . . . . 6 ⊢ (𝑟 ∈ V → (𝑟 ∈ Rels ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) = 𝑟))
12	11	elv 3459	. . . . 5 ⊢ (𝑟 ∈ Rels ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) = 𝑟)
13	12	biimpi 219	. . . 4 ⊢ (𝑟 ∈ Rels → (𝑟 ∩ (dom 𝑟 × ran 𝑟)) = 𝑟)
14	13	sseq1d 3944	. . 3 ⊢ (𝑟 ∈ Rels → ((𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟)) ↔ 𝑟 ⊆ ( I ∩ (dom 𝑟 × ran 𝑟))))
15	10, 14	bitrid 286	. 2 ⊢ (𝑟 ∈ Rels → (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ 𝑟 ⊆ ( I ∩ (dom 𝑟 × ran 𝑟))))
16	1, 2, 15	abeqinbi 39378	1 ⊢ CnvRefRels = {𝑟 ∈ Rels ∣ 𝑟 ⊆ ( I ∩ (dom 𝑟 × ran 𝑟))}

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   class class class wbr 5106   I cid 5549   × cxp 5653  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   Rels crels 39308   S cssr 39309   CnvRefs ccnvrefs 39313   CnvRefRels ccnvrefrels 39314

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-rels 39563  df-ssr 39701  df-cnvrefs 39728  df-cnvrefrels 39729

This theorem is used by:  elcnvrefrels2  39737