Theorem rninOLD 6142

Description: Obsolete version of rnin 6141 as of 10-Jun-2026. (Contributed by NM, 15-Sep-2004.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
rninOLD	⊢ ran (𝐴 ∩ 𝐵) ⊆ (ran 𝐴 ∩ ran 𝐵)

Proof of Theorem rninOLD

Step	Hyp	Ref	Expression
1		cnvin 6139	. . . 4 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)
2	1	dmeqi 5892	. . 3 ⊢ dom ◡(𝐴 ∩ 𝐵) = dom (◡𝐴 ∩ ◡𝐵)
3		dmin 5899	. . 3 ⊢ dom (◡𝐴 ∩ ◡𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
4	2, 3	eqsstri 3980	. 2 ⊢ dom ◡(𝐴 ∩ 𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
5		df-rn 5670	. 2 ⊢ ran (𝐴 ∩ 𝐵) = dom ◡(𝐴 ∩ 𝐵)
6		df-rn 5670	. . 3 ⊢ ran 𝐴 = dom ◡𝐴
7		df-rn 5670	. . 3 ⊢ ran 𝐵 = dom ◡𝐵
8	6, 7	ineq12i 4167	. 2 ⊢ (ran 𝐴 ∩ ran 𝐵) = (dom ◡𝐴 ∩ dom ◡𝐵)
9	4, 5, 8	3sstr4i 3985	1 ⊢ ran (𝐴 ∩ 𝐵) ⊆ (ran 𝐴 ∩ ran 𝐵)

This proof depends on syntax axioms:   ∩ cin 3901   ⊆ wss 3902  ^◡ccnv 5658  dom cdm 5659  ran crn 5660

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670

This theorem is used by: (None)