Theorem sbthlemi6 7232

Description: Lemma for isbth 7237. (Contributed by NM, 27-Mar-1998.)

Hypotheses

Ref	Expression
sbthlem.1	|- A e. _V
sbthlem.2	|- D = { x | ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) }
sbthlem.3	|- H = ( ( f |` U. D ) u. ( `' g |` ( A \ U. D ) ) )

Assertion

Ref	Expression
sbthlemi6	|- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> ran H = B )

Distinct variable groups:   x, A   x, B   x, D   x, f   x, g   x, H

Allowed substitution hints:   A( f, g)   B( f, g)   D( f, g)   H( f, g)

Proof of Theorem sbthlemi6

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 527	. . 3 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> EXMID )
2		simprll 539	. . 3 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> dom g = B )
3		simprlr 540	. . 3 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> ran g C_ A )
4		simprr 533	. . 3 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> Fun `' g )
5		rnun 5171	. . . . 5 |- ran ( ( f |` U. D ) u. ( `' g |` ( A \ U. D ) ) ) = ( ran ( f |` U. D ) u. ran ( `' g |` ( A \ U. D ) ) )
6		sbthlem.3	. . . . . 6 |- H = ( ( f |` U. D ) u. ( `' g |` ( A \ U. D ) ) )
7	6	rneqi 4985	. . . . 5 |- ran H = ran ( ( f |` U. D ) u. ( `' g |` ( A \ U. D ) ) )
8		df-ima 4762	. . . . . 6 |- ( f " U. D ) = ran ( f |` U. D )
9	8	uneq1i 3369	. . . . 5 |- ( ( f " U. D ) u. ran ( `' g |` ( A \ U. D ) ) ) = ( ran ( f |` U. D ) u. ran ( `' g |` ( A \ U. D ) ) )
10	5, 7, 9	3eqtr4i 2263	. . . 4 |- ran H = ( ( f " U. D ) u. ran ( `' g |` ( A \ U. D ) ) )
11		sbthlem.1	. . . . . . 7 |- A e. _V
12		sbthlem.2	. . . . . . 7 |- D = { x | ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) }
13	11, 12	sbthlemi4 7230	. . . . . 6 |- ( (EXMID /\ ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) -> ( `' g " ( A \ U. D ) ) = ( B \ ( f " U. D ) ) )
14		df-ima 4762	. . . . . 6 |- ( `' g " ( A \ U. D ) ) = ran ( `' g |` ( A \ U. D ) )
15	13, 14	eqtr3di 2280	. . . . 5 |- ( (EXMID /\ ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) -> ( B \ ( f " U. D ) ) = ran ( `' g |` ( A \ U. D ) ) )
16	15	uneq2d 3373	. . . 4 |- ( (EXMID /\ ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) -> ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) = ( ( f " U. D ) u. ran ( `' g |` ( A \ U. D ) ) ) )
17	10, 16	eqtr4id 2284	. . 3 |- ( (EXMID /\ ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) -> ran H = ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) )
18	1, 2, 3, 4, 17	syl121anc 1279	. 2 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> ran H = ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) )
19		imassrn 5112	. . . . . . 7 |- ( f " U. D ) C_ ran f
20		sstr2 3245	. . . . . . 7 |- ( ( f " U. D ) C_ ran f -> ( ran f C_ B -> ( f " U. D ) C_ B ) )
21	19, 20	ax-mp 5	. . . . . 6 |- ( ran f C_ B -> ( f " U. D ) C_ B )
22	21	adantl 277	. . . . 5 |- ( (EXMID /\ ran f C_ B ) -> ( f " U. D ) C_ B )
23		undifdcss 7183	. . . . . . 7 |- ( B = ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) <-> ( ( f " U. D ) C_ B /\ A. y e. B DECID y e. ( f " U. D ) ) )
24		exmidexmid 4309	. . . . . . . . 9 |- (EXMID -> DECID y e. ( f " U. D ) )
25	24	ralrimivw 2616	. . . . . . . 8 |- (EXMID -> A. y e. B DECID y e. ( f " U. D ) )
26	25	biantrud 304	. . . . . . 7 |- (EXMID -> ( ( f " U. D ) C_ B <-> ( ( f " U. D ) C_ B /\ A. y e. B DECID y e. ( f " U. D ) ) ) )
27	23, 26	bitr4id 199	. . . . . 6 |- (EXMID -> ( B = ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) <-> ( f " U. D ) C_ B ) )
28	27	adantr 276	. . . . 5 |- ( (EXMID /\ ran f C_ B ) -> ( B = ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) <-> ( f " U. D ) C_ B ) )
29	22, 28	mpbird 167	. . . 4 |- ( (EXMID /\ ran f C_ B ) -> B = ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) )
30	29	eqcomd 2238	. . 3 |- ( (EXMID /\ ran f C_ B ) -> ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) = B )
31	30	adantr 276	. 2 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> ( ( f " U. D ) u. ( B \ ( f " U. D ) ) ) = B )
32	18, 31	eqtrd 2265	1 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> ran H = B )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 842   /\ w3a 1005   = wceq 1398   e. wcel 2203   {cab 2218   A.wral 2520   _Vcvv 2813   \ cdif 3208   u. cun 3209   C_ wss 3211   U.cuni 3914  EXMIDwem 4307   `'ccnv 4748   dom cdm 4749   ran crn 4750   |` cres 4751   "cima 4752   Fun wfun 5346

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322

This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-exmid 4308  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-fun 5354

This theorem is referenced by:  sbthlemi9  7235