Theorem ssiun2s 2662

Description: Subset relationship for an indexed union.

Hypothesis

Ref	Expression
ssiun2s.1	|- (x = C -> B = D)

Assertion

Ref	Expression
ssiun2s	|- (C e. A -> D (_ U_x e. A B)

Distinct variable groups:   x,A   x,C   x,D

Proof of Theorem ssiun2s

Step	Hyp	Ref	Expression
1		ax-17 1007	. . 3 |- (y e. C -> A.x y e. C)
2		ax-17 1007	. . . 4 |- (C e. A -> A.x C e. A)
3		ax-17 1007	. . . . 5 |- (y e. D -> A.x y e. D)
4		hbiu1 2652	. . . . 5 |- (y e. U_x e. A B -> A.x y e. U_x e. A B)
5	3, 4	hbss 2114	. . . 4 |- (D (_ U_x e. A B -> A.x D (_ U_x e. A B)
6	2, 5	hbim 1043	. . 3 |- ((C e. A -> D (_ U_x e. A B) -> A.x(C e. A -> D (_ U_x e. A B))
7		eleq1 1577	. . . 4 |- (x = C -> (x e. A <-> C e. A))
8		ssiun2s.1	. . . . 5 |- (x = C -> B = D)
9	8	sseq1d 2140	. . . 4 |- (x = C -> (B (_ U_x e. A B <-> D (_ U_x e. A B))
10	7, 9	imbi12d 629	. . 3 |- (x = C -> ((x e. A -> B (_ U_x e. A B) <-> (C e. A -> D (_ U_x e. A B)))
11		ssiun2 2661	. . 3 |- (x e. A -> B (_ U_x e. A B)
12	1, 6, 10, 11	vtoclgf 1892	. 2 |- (C e. A -> (C e. A -> D (_ U_x e. A B))
13	12	pm2.43i 64	1 |- (C e. A -> D (_ U_x e. A B)

Syntax hints:   -> wi 3   = wceq 992   e. wcel 994   (_ wss 2099  U_ciun 2633

This theorem is referenced by:  onfununi 4209  oaordi 4316  omordi 4333  alephordlem2 5023  alephordi 5024  fictb 11423

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-12 1004  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255  ax-ext 1500

This theorem depends on definitions:  df-bi 145  df-an 223  df-ex 1017  df-sb 1209  df-clab 1506  df-cleq 1511  df-clel 1514  df-rex 1696  df-v 1858  df-in 2103  df-ss 2105  df-iun 2635

Copyright terms: Public domain