Theorem sbthlem5 4431

Description: Lemma for sbth 4437.

Hypotheses

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

Assertion

Ref	Expression
sbthlem5	|- ((dom f = A /\ ran g (_ A) -> dom H = A)

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

Proof of Theorem sbthlem5

Step	Hyp	Ref	Expression
1		sbthlem.1	. . . . . . . . 9 |- A e. V
2		sbthlem.2	. . . . . . . . 9 |- D = {x | (x (_ A /\ (g"(B \ (f"x))) (_ (A \ x))}
3	1, 2	sbthlem1 4427	. . . . . . . 8 |- U.D (_ (A \ (g"(B \ (f"U.D))))
4		difss 2157	. . . . . . . 8 |- (A \ (g"(B \ (f"U.D)))) (_ A
5	3, 4	sstri 2063	. . . . . . 7 |- U.D (_ A
6		sseq2 2073	. . . . . . 7 |- (dom f = A -> (U.D (_ dom f <-> U.D (_ A))
7	5, 6	mpbiri 194	. . . . . 6 |- (dom f = A -> U.D (_ dom f)
8		dfss 2044	. . . . . 6 |- (U.D (_ dom f <-> U.D = (U.D i^i dom f))
9	7, 8	sylib 198	. . . . 5 |- (dom f = A -> U.D = (U.D i^i dom f))
10	9	uneq1d 2173	. . . 4 |- (dom f = A -> (U.D u. (A \ U.D)) = ((U.D i^i dom f) u. (A \ U.D)))
11		imassrn 3399	. . . . . . 7 |- (g"(B \ (f"U.D))) (_ ran g
12	1, 2	sbthlem3 4429	. . . . . . . 8 |- (ran g (_ A -> (g"(B \ (f"U.D))) = (A \ U.D))
13	12	sseq1d 2078	. . . . . . 7 |- (ran g (_ A -> ((g"(B \ (f"U.D))) (_ ran g <-> (A \ U.D) (_ ran g))
14	11, 13	mpbii 193	. . . . . 6 |- (ran g (_ A -> (A \ U.D) (_ ran g)
15		dfss 2044	. . . . . 6 |- ((A \ U.D) (_ ran g <-> (A \ U.D) = ((A \ U.D) i^i ran g))
16	14, 15	sylib 198	. . . . 5 |- (ran g (_ A -> (A \ U.D) = ((A \ U.D) i^i ran g))
17	16	uneq2d 2174	. . . 4 |- (ran g (_ A -> ((U.D i^i dom f) u. (A \ U.D)) = ((U.D i^i dom f) u. ((A \ U.D) i^i ran g)))
18	10, 17	sylan9eq 1519	. . 3 |- ((dom f = A /\ ran g (_ A) -> (U.D u. (A \ U.D)) = ((U.D i^i dom f) u. ((A \ U.D) i^i ran g)))
19		sbthlem.3	. . . . 5 |- H = ((f |` U.D) u. (`'g |` (A \ U.D)))
20	19	dmeqi 3301	. . . 4 |- dom H = dom ((f |` U.D) u. (`'g |` (A \ U.D)))
21		dmun 3306	. . . 4 |- dom ((f |` U.D) u. (`'g |` (A \ U.D))) = (dom ( f |` U.D) u. dom (`'g |` (A \ U.D)))
22		dmres 3364	. . . . 5 |- dom ( f |` U.D) = (U.D i^i dom f)
23		dmres 3364	. . . . . 6 |- dom (`'g |` (A \ U.D)) = ((A \ U.D) i^i dom `' g)
24		df-rn 3179	. . . . . . . 8 |- ran g = dom `' g
25	24	eqcomi 1471	. . . . . . 7 |- dom `' g = ran g
26	25	ineq2i 2204	. . . . . 6 |- ((A \ U.D) i^i dom `' g) = ((A \ U.D) i^i ran g)
27	23, 26	eqtr 1487	. . . . 5 |- dom (`'g |` (A \ U.D)) = ((A \ U.D) i^i ran g)
28	22, 27	uneq12i 2172	. . . 4 |- (dom ( f |` U.D) u. dom (`'g |` (A \ U.D))) = ((U.D i^i dom f) u. ((A \ U.D) i^i ran g))
29	20, 21, 28	3eqtr 1491	. . 3 |- dom H = ((U.D i^i dom f) u. ((A \ U.D) i^i ran g))
30	18, 29	syl6reqr 1518	. 2 |- ((dom f = A /\ ran g (_ A) -> dom H = (U.D u. (A \ U.D)))
31		undif 2333	. . 3 |- (U.D (_ A <-> (U.D u. (A \ U.D)) = A)
32	5, 31	mpbi 189	. 2 |- (U.D u. (A \ U.D)) = A
33	30, 32	syl6eq 1515	1 |- ((dom f = A /\ ran g (_ A) -> dom H = A)

Syntax hints:   -> wi 3   /\ wa 223   = wceq 953   e. wcel 955  {cab 1456  Vcvv 1802   \ cdif 2034   u. cun 2035   i^i cin 2036   (_ wss 2037  U.cuni 2493  `'ccnv 3159  dom cdm 3160  ran crn 3161   |` cres 3162  "cima 3163

This theorem is referenced by:  sbthlem9 4435

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732  ax-pr 2769

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-op 2406  df-uni 2494  df-br 2610  df-opab 2657  df-xp 3174  df-rel 3175  df-cnv 3176  df-dm 3178  df-rn 3179  df-res 3180  df-ima 3181

Copyright terms: Public domain