Theorem rninOLD 6133

Description: Obsolete version of rnin 6132 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 6130	. . . 4 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)
2	1	dmeqi 5882	. . 3 ⊢ dom ◡(𝐴 ∩ 𝐵) = dom (◡𝐴 ∩ ◡𝐵)
3		dmin 5889	. . 3 ⊢ dom (◡𝐴 ∩ ◡𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
4	2, 3	eqsstri 3984	. 2 ⊢ dom ◡(𝐴 ∩ 𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
5		df-rn 5660	. 2 ⊢ ran (𝐴 ∩ 𝐵) = dom ◡(𝐴 ∩ 𝐵)
6		df-rn 5660	. . 3 ⊢ ran 𝐴 = dom ◡𝐴
7		df-rn 5660	. . 3 ⊢ ran 𝐵 = dom ◡𝐵
8	6, 7	ineq12i 4172	. 2 ⊢ (ran 𝐴 ∩ ran 𝐵) = (dom ◡𝐴 ∩ dom ◡𝐵)
9	4, 5, 8	3sstr4i 3989	1 ⊢ ran (𝐴 ∩ 𝐵) ⊆ (ran 𝐴 ∩ ran 𝐵)

Syntax hints:   ∩ cin 3905   ⊆ wss 3906  ^◡ccnv 5648  dom cdm 5649  ran crn 5650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5103  df-opab 5165  df-xp 5655  df-rel 5656  df-cnv 5657  df-dm 5659  df-rn 5660

This theorem is referenced by: (None)