Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbthlem8 Structured version   Visualization version   GIF version

Theorem sbthlem8 8622
 Description: Lemma for sbth 8625. (Contributed by NM, 27-Mar-1998.)
Hypotheses
Ref Expression
sbthlem.1 𝐴 ∈ V
sbthlem.2 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
sbthlem.3 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
Assertion
Ref Expression
sbthlem8 ((Fun 𝑓 ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → Fun 𝐻)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓   𝑥,𝑔   𝑥,𝐻
Allowed substitution hints:   𝐴(𝑓,𝑔)   𝐵(𝑓,𝑔)   𝐷(𝑓,𝑔)   𝐻(𝑓,𝑔)

Proof of Theorem sbthlem8
StepHypRef Expression
1 funres11 6410 . . . 4 (Fun 𝑓 → Fun (𝑓 𝐷))
2 funcnvcnv 6400 . . . . . 6 (Fun 𝑔 → Fun 𝑔)
3 funres11 6410 . . . . . 6 (Fun 𝑔 → Fun (𝑔 ↾ (𝐴 𝐷)))
42, 3syl 17 . . . . 5 (Fun 𝑔 → Fun (𝑔 ↾ (𝐴 𝐷)))
54ad3antrrr 729 . . . 4 ((((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → Fun (𝑔 ↾ (𝐴 𝐷)))
61, 5anim12i 615 . . 3 ((Fun 𝑓 ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → (Fun (𝑓 𝐷) ∧ Fun (𝑔 ↾ (𝐴 𝐷))))
7 df-ima 5545 . . . . . . . 8 (𝑓 𝐷) = ran (𝑓 𝐷)
8 df-rn 5543 . . . . . . . 8 ran (𝑓 𝐷) = dom (𝑓 𝐷)
97, 8eqtr2i 2846 . . . . . . 7 dom (𝑓 𝐷) = (𝑓 𝐷)
10 df-ima 5545 . . . . . . . . 9 (𝑔 “ (𝐴 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷))
11 df-rn 5543 . . . . . . . . 9 ran (𝑔 ↾ (𝐴 𝐷)) = dom (𝑔 ↾ (𝐴 𝐷))
1210, 11eqtri 2845 . . . . . . . 8 (𝑔 “ (𝐴 𝐷)) = dom (𝑔 ↾ (𝐴 𝐷))
13 sbthlem.1 . . . . . . . . 9 𝐴 ∈ V
14 sbthlem.2 . . . . . . . . 9 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1513, 14sbthlem4 8618 . . . . . . . 8 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝑔 “ (𝐴 𝐷)) = (𝐵 ∖ (𝑓 𝐷)))
1612, 15syl5eqr 2871 . . . . . . 7 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → dom (𝑔 ↾ (𝐴 𝐷)) = (𝐵 ∖ (𝑓 𝐷)))
17 ineq12 4158 . . . . . . 7 ((dom (𝑓 𝐷) = (𝑓 𝐷) ∧ dom (𝑔 ↾ (𝐴 𝐷)) = (𝐵 ∖ (𝑓 𝐷))) → (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ((𝑓 𝐷) ∩ (𝐵 ∖ (𝑓 𝐷))))
189, 16, 17sylancr 590 . . . . . 6 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ((𝑓 𝐷) ∩ (𝐵 ∖ (𝑓 𝐷))))
19 disjdif 4393 . . . . . 6 ((𝑓 𝐷) ∩ (𝐵 ∖ (𝑓 𝐷))) = ∅
2018, 19syl6eq 2873 . . . . 5 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ∅)
2120adantlll 717 . . . 4 ((((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ∅)
2221adantl 485 . . 3 ((Fun 𝑓 ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ∅)
23 funun 6379 . . 3 (((Fun (𝑓 𝐷) ∧ Fun (𝑔 ↾ (𝐴 𝐷))) ∧ (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ∅) → Fun ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))))
246, 22, 23syl2anc 587 . 2 ((Fun 𝑓 ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → Fun ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))))
25 sbthlem.3 . . . . 5 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
2625cnveqi 5722 . . . 4 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
27 cnvun 5979 . . . 4 ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
2826, 27eqtri 2845 . . 3 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
2928funeqi 6355 . 2 (Fun 𝐻 ↔ Fun ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))))
3024, 29sylibr 237 1 ((Fun 𝑓 ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → Fun 𝐻)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2114  {cab 2800  Vcvv 3469   ∖ cdif 3905   ∪ cun 3906   ∩ cin 3907   ⊆ wss 3908  ∅c0 4265  ∪ cuni 4813  ◡ccnv 5531  dom cdm 5532  ran crn 5533   ↾ cres 5534   “ cima 5535  Fun wfun 6328 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pr 5307 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-br 5043  df-opab 5105  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-fun 6336 This theorem is referenced by:  sbthlem9  8623
 Copyright terms: Public domain W3C validator