HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem sbthlem7 4433
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
sbthlem7 |- ((Fun f /\ Fun `'g) -> Fun H)
Distinct variable groups:   x,A   x,B   x,D   x,f   x,g   x,H

Proof of Theorem sbthlem7
StepHypRef Expression
1 dmres 3364 . . . . . . . . 9 |- dom ( f |` U.D) = (U.D i^i dom f)
2 inss1 2220 . . . . . . . . 9 |- (U.D i^i dom f) (_ U.D
31, 2eqsstr 2081 . . . . . . . 8 |- dom ( f |` U.D) (_ U.D
4 ssrin 2224 . . . . . . . 8 |- (dom ( f |` U.D) (_ U.D -> (dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) (_ (U.D i^i dom (`'g |` (A \ U.D))))
53, 4ax-mp 7 . . . . . . 7 |- (dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) (_ (U.D i^i dom (`'g |` (A \ U.D)))
6 dmres 3364 . . . . . . . . 9 |- dom (`'g |` (A \ U.D)) = ((A \ U.D) i^i dom `' g)
7 inss1 2220 . . . . . . . . 9 |- ((A \ U.D) i^i dom `' g) (_ (A \ U.D)
86, 7eqsstr 2081 . . . . . . . 8 |- dom (`'g |` (A \ U.D)) (_ (A \ U.D)
9 sslin 2225 . . . . . . . 8 |- (dom (`'g |` (A \ U.D)) (_ (A \ U.D) -> (U.D i^i dom (`'g |` (A \ U.D))) (_ (U.D i^i (A \ U.D)))
108, 9ax-mp 7 . . . . . . 7 |- (U.D i^i dom (`'g |` (A \ U.D))) (_ (U.D i^i (A \ U.D))
115, 10sstri 2063 . . . . . 6 |- (dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) (_ (U.D i^i (A \ U.D))
12 difdisj 2327 . . . . . 6 |- (U.D i^i (A \ U.D)) = (/)
1311, 12sseqtr 2083 . . . . 5 |- (dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) (_ (/)
14 ss0 2293 . . . . 5 |- ((dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) (_ (/) -> (dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) = (/))
1513, 14ax-mp 7 . . . 4 |- (dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) = (/)
16 funun 3540 . . . 4 |- (((Fun (f |` U.D) /\ Fun (`'g |` (A \ U.D))) /\ (dom ( f |` U.D) i^i dom (`'g |` (A \ U.D))) = (/)) -> Fun ((f |` U.D) u. (`'g |` (A \ U.D))))
1715, 16mpan2 694 . . 3 |- ((Fun (f |` U.D) /\ Fun (`'g |` (A \ U.D))) -> Fun ((f |` U.D) u. (`'g |` (A \ U.D))))
18 funres 3537 . . 3 |- (Fun f -> Fun (f |` U.D))
19 funres 3537 . . 3 |- (Fun `'g -> Fun (`'g |` (A \ U.D)))
2017, 18, 19syl2an 454 . 2 |- ((Fun f /\ Fun `'g) -> Fun ((f |` U.D) u. (`'g |` (A \ U.D))))
21 sbthlem.3 . . 3 |- H = ((f |` U.D) u. (`'g |` (A \ U.D)))
22 funeq 3521 . . 3 |- (H = ((f |` U.D) u. (`'g |` (A \ U.D))) -> (Fun H <-> Fun ((f |` U.D) u. (`'g |` (A \ U.D)))))
2321, 22ax-mp 7 . 2 |- (Fun H <-> Fun ((f |` U.D) u. (`'g |` (A \ U.D))))
2420, 23sylibr 200 1 |- ((Fun f /\ Fun `'g) -> Fun H)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 953   e. wcel 955  {cab 1456  Vcvv 1802   \ cdif 2034   u. cun 2035   i^i cin 2036   (_ wss 2037  (/)c0 2270  U.cuni 2493  `'ccnv 3159  dom cdm 3160   |` cres 3162  "cima 3163  Fun wfun 3166
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-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-br 2610  df-opab 2657  df-id 2824  df-xp 3174  df-rel 3175  df-cnv 3176  df-co 3177  df-dm 3178  df-res 3180  df-fun 3182
Copyright terms: Public domain