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

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

Proof of Theorem sbthlem5
StepHypRef Expression
1 sbthlem.3 . . . . 5 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
21dmeqi 5894 . . . 4 dom 𝐻 = dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
3 dmun 5900 . . . . 5 dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷)))
4 dmres 6011 . . . . . 6 dom (𝑓 𝐷) = ( 𝐷 ∩ dom 𝑓)
5 dmres 6011 . . . . . . 7 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ dom 𝑔)
6 df-rn 5672 . . . . . . . . 9 ran 𝑔 = dom 𝑔
76eqcomi 2772 . . . . . . . 8 dom 𝑔 = ran 𝑔
87ineq2i 4170 . . . . . . 7 ((𝐴 𝐷) ∩ dom 𝑔) = ((𝐴 𝐷) ∩ ran 𝑔)
95, 8eqtri 2786 . . . . . 6 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ ran 𝑔)
104, 9uneq12i 4120 . . . . 5 (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷))) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
113, 10eqtri 2786 . . . 4 dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
122, 11eqtri 2786 . . 3 dom 𝐻 = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
13 sbthlem.1 . . . . . . . . 9 𝐴 ∈ V
14 sbthlem.2 . . . . . . . . 9 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1513, 14sbthlem1 9071 . . . . . . . 8 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
16 difss 4090 . . . . . . . 8 (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐴
1715, 16sstri 3946 . . . . . . 7 𝐷𝐴
18 sseq2 3963 . . . . . . 7 (dom 𝑓 = 𝐴 → ( 𝐷 ⊆ dom 𝑓 𝐷𝐴))
1917, 18mpbiri 261 . . . . . 6 (dom 𝑓 = 𝐴 𝐷 ⊆ dom 𝑓)
20 dfss 3924 . . . . . 6 ( 𝐷 ⊆ dom 𝑓 𝐷 = ( 𝐷 ∩ dom 𝑓))
2119, 20sylib 221 . . . . 5 (dom 𝑓 = 𝐴 𝐷 = ( 𝐷 ∩ dom 𝑓))
2221uneq1d 4121 . . . 4 (dom 𝑓 = 𝐴 → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)))
2313, 14sbthlem3 9073 . . . . . . 7 (ran 𝑔𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) = (𝐴 𝐷))
24 imassrn 6073 . . . . . . 7 (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ ran 𝑔
2523, 24eqsstrrdi 3982 . . . . . 6 (ran 𝑔𝐴 → (𝐴 𝐷) ⊆ ran 𝑔)
26 dfss 3924 . . . . . 6 ((𝐴 𝐷) ⊆ ran 𝑔 ↔ (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2725, 26sylib 221 . . . . 5 (ran 𝑔𝐴 → (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2827uneq2d 4122 . . . 4 (ran 𝑔𝐴 → (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2922, 28sylan9eq 2818 . . 3 ((dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
3012, 29eqtr4id 2817 . 2 ((dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴) → dom 𝐻 = ( 𝐷 ∪ (𝐴 𝐷)))
31 undif 4443 . . 3 ( 𝐷𝐴 ↔ ( 𝐷 ∪ (𝐴 𝐷)) = 𝐴)
3217, 31mpbi 233 . 2 ( 𝐷 ∪ (𝐴 𝐷)) = 𝐴
3330, 32eqtrdi 2814 1 ((dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴) → dom 𝐻 = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  {cab 2741  Vcvv 3455  cdif 3902  cun 3903  cin 3904  wss 3905   cuni 4872  ccnv 5660  dom cdm 5661  ran crn 5662  cres 5663  cima 5664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-xp 5667  df-cnv 5669  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674
This theorem is referenced by:  sbthlem9  9079
  Copyright terms: Public domain W3C validator