Theorem rnmptssrn 46001

Description: Inclusion relation for two ranges expressed in maps-to notation. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
rnmptssrn.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
rnmptssrn.y	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐶 𝐵 = 𝐷)

Assertion

Ref	Expression
rnmptssrn	⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ran (𝑦 ∈ 𝐶 ↦ 𝐷))

Distinct variable groups:   𝑥,𝐴   𝑦,𝐵   𝑥,𝐶   𝑥,𝐷   𝜑,𝑥   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑦)   𝐵(𝑥)   𝐶(𝑦)   𝐷(𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem rnmptssrn

Step	Hyp	Ref	Expression
1		eqid 2762	. . . 4 ⊢ (𝑦 ∈ 𝐶 ↦ 𝐷) = (𝑦 ∈ 𝐶 ↦ 𝐷)
2		rnmptssrn.y	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐶 𝐵 = 𝐷)
3		rnmptssrn.b	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
4	1, 2, 3	elrnmptd 5951	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran (𝑦 ∈ 𝐶 ↦ 𝐷))
5	4	ralrimiva 3156	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ ran (𝑦 ∈ 𝐶 ↦ 𝐷))
6		eqid 2762	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
7	6	rnmptss 7119	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ ran (𝑦 ∈ 𝐶 ↦ 𝐷) → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ran (𝑦 ∈ 𝐶 ↦ 𝐷))
8	5, 7	syl 18	1 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ran (𝑦 ∈ 𝐶 ↦ 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902   ↦ cmpt 5190  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-10 2178  ax-11 2194  ax-12 2215  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-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  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-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-fun 6539  df-fn 6540  df-f 6541

This theorem is used by:  sge0f1o  47197