Theorem ss2iundv 44446

Description: Subclass theorem for indexed union. (Contributed by RP, 17-Jul-2020.)

Hypotheses

Ref	Expression
ss2iundv.el	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑌 ∈ 𝐶)
ss2iundv.sub	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑌) → 𝐷 = 𝐺)
ss2iundv.ss	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐺)

Assertion

Ref	Expression
ss2iundv	⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ 𝑦 ∈ 𝐶 𝐷)

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

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐷(𝑦)   𝐺(𝑥)   𝑌(𝑥)

Proof of Theorem ss2iundv

Step	Hyp	Ref	Expression
1		nfv 1947	. 2 ⊢ Ⅎ𝑥𝜑
2		nfv 1947	. 2 ⊢ Ⅎ𝑦𝜑
3		nfcv 2927	. 2 ⊢ Ⅎ𝑦𝑌
4		nfcv 2927	. 2 ⊢ Ⅎ𝑦𝐴
5		nfcv 2927	. 2 ⊢ Ⅎ𝑦𝐵
6		nfcv 2927	. 2 ⊢ Ⅎ𝑥𝐶
7		nfcv 2927	. 2 ⊢ Ⅎ𝑦𝐶
8		nfcv 2927	. 2 ⊢ Ⅎ𝑥𝐷
9		nfcv 2927	. 2 ⊢ Ⅎ𝑦𝐺
10		ss2iundv.el	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑌 ∈ 𝐶)
11		ss2iundv.sub	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑌) → 𝐷 = 𝐺)
12		ss2iundv.ss	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐺)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	ss2iundf 44445	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ 𝑦 ∈ 𝐶 𝐷)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ⊆ wss 3906  ∪ ciun 4958

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-v 3459  df-ss 3923  df-iun 4960

This theorem is used by: (None)