Theorem rninOLD 6149

Description: Obsolete version of rnin 6148 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 6146	. . . 4 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)
2	1	dmeqi 5892	. . 3 ⊢ dom ◡(𝐴 ∩ 𝐵) = dom (◡𝐴 ∩ ◡𝐵)
3		dmin 5899	. . 3 ⊢ dom (◡𝐴 ∩ ◡𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
4	2, 3	eqsstri 3959	. 2 ⊢ dom ◡(𝐴 ∩ 𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
5		df-rn 5666	. 2 ⊢ ran (𝐴 ∩ 𝐵) = dom ◡(𝐴 ∩ 𝐵)
6		df-rn 5666	. . 3 ⊢ ran 𝐴 = dom ◡𝐴
7		df-rn 5666	. . 3 ⊢ ran 𝐵 = dom ◡𝐵
8	6, 7	ineq12i 4118	. 2 ⊢ (ran 𝐴 ∩ ran 𝐵) = (dom ◡𝐴 ∩ dom ◡𝐵)
9	4, 5, 8	3sstr4i 3964	1 ⊢ ran (𝐴 ∩ 𝐵) ⊆ (ran 𝐴 ∩ ran 𝐵)

This proof depends on syntax axioms:   ⊆ wss 3900   ∩ cin 4092  ^◡ccnv 5654  dom cdm 5655  ran crn 5656

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-pr 5395

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-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666

This theorem is used by: (None)