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

Theorem sbthlem5 9031
Description: Lemma for sbth 9037. (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 5861 . . . 4 dom 𝐻 = dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
3 dmun 5867 . . . . 5 dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷)))
4 dmres 5979 . . . . . 6 dom (𝑓 𝐷) = ( 𝐷 ∩ dom 𝑓)
5 dmres 5979 . . . . . . 7 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ dom 𝑔)
6 df-rn 5643 . . . . . . . . 9 ran 𝑔 = dom 𝑔
76eqcomi 2746 . . . . . . . 8 dom 𝑔 = ran 𝑔
87ineq2i 4171 . . . . . . 7 ((𝐴 𝐷) ∩ dom 𝑔) = ((𝐴 𝐷) ∩ ran 𝑔)
95, 8eqtri 2760 . . . . . 6 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ ran 𝑔)
104, 9uneq12i 4120 . . . . 5 (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷))) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
113, 10eqtri 2760 . . . 4 dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
122, 11eqtri 2760 . . 3 dom 𝐻 = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
13 sbthlem.1 . . . . . . . . 9 𝐴 ∈ V
14 sbthlem.2 . . . . . . . . 9 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1513, 14sbthlem1 9027 . . . . . . . 8 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
16 difss 4090 . . . . . . . 8 (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐴
1715, 16sstri 3945 . . . . . . 7 𝐷𝐴
18 sseq2 3962 . . . . . . 7 (dom 𝑓 = 𝐴 → ( 𝐷 ⊆ dom 𝑓 𝐷𝐴))
1917, 18mpbiri 258 . . . . . 6 (dom 𝑓 = 𝐴 𝐷 ⊆ dom 𝑓)
20 dfss 3922 . . . . . 6 ( 𝐷 ⊆ dom 𝑓 𝐷 = ( 𝐷 ∩ dom 𝑓))
2119, 20sylib 218 . . . . 5 (dom 𝑓 = 𝐴 𝐷 = ( 𝐷 ∩ dom 𝑓))
2221uneq1d 4121 . . . 4 (dom 𝑓 = 𝐴 → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)))
2313, 14sbthlem3 9029 . . . . . . 7 (ran 𝑔𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) = (𝐴 𝐷))
24 imassrn 6038 . . . . . . 7 (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ ran 𝑔
2523, 24eqsstrrdi 3981 . . . . . 6 (ran 𝑔𝐴 → (𝐴 𝐷) ⊆ ran 𝑔)
26 dfss 3922 . . . . . 6 ((𝐴 𝐷) ⊆ ran 𝑔 ↔ (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2725, 26sylib 218 . . . . 5 (ran 𝑔𝐴 → (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2827uneq2d 4122 . . . 4 (ran 𝑔𝐴 → (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2922, 28sylan9eq 2792 . . 3 ((dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
3012, 29eqtr4id 2791 . 2 ((dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴) → dom 𝐻 = ( 𝐷 ∪ (𝐴 𝐷)))
31 undif 4436 . . 3 ( 𝐷𝐴 ↔ ( 𝐷 ∪ (𝐴 𝐷)) = 𝐴)
3217, 31mpbi 230 . 2 ( 𝐷 ∪ (𝐴 𝐷)) = 𝐴
3330, 32eqtrdi 2788 1 ((dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴) → dom 𝐻 = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2715  Vcvv 3442  cdif 3900  cun 3901  cin 3902  wss 3903   cuni 4865  ccnv 5631  dom cdm 5632  ran crn 5633  cres 5634  cima 5635
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-xp 5638  df-cnv 5640  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645
This theorem is referenced by:  sbthlem9  9035
  Copyright terms: Public domain W3C validator