Theorem rninOLD 6132

Description: Obsolete version of rnin 6131 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 6129	. . . 4 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)
2	1	dmeqi 5882	. . 3 ⊢ dom ◡(𝐴 ∩ 𝐵) = dom (◡𝐴 ∩ ◡𝐵)
3		dmin 5889	. . 3 ⊢ dom (◡𝐴 ∩ ◡𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
4	2, 3	eqsstri 3976	. 2 ⊢ dom ◡(𝐴 ∩ 𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵)
5		df-rn 5658	. 2 ⊢ ran (𝐴 ∩ 𝐵) = dom ◡(𝐴 ∩ 𝐵)
6		df-rn 5658	. . 3 ⊢ ran 𝐴 = dom ◡𝐴
7		df-rn 5658	. . 3 ⊢ ran 𝐵 = dom ◡𝐵
8	6, 7	ineq12i 4163	. 2 ⊢ (ran 𝐴 ∩ ran 𝐵) = (dom ◡𝐴 ∩ dom ◡𝐵)
9	4, 5, 8	3sstr4i 3981	1 ⊢ ran (𝐴 ∩ 𝐵) ⊆ (ran 𝐴 ∩ ran 𝐵)

This proof depends on syntax axioms:   ∩ cin 3897   ⊆ wss 3898  ^◡ccnv 5646  dom cdm 5647  ran crn 5648

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 2732  ax-sep 5248  ax-pr 5390

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 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5653  df-rel 5654  df-cnv 5655  df-dm 5657  df-rn 5658

This theorem is used by: (None)