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

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

Proof of Theorem sbthlem6
StepHypRef Expression
1 rnun 6177 . . . 4 ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
2 sbthlem.3 . . . . 5 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
32rneqi 5962 . . . 4 ran 𝐻 = ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
4 df-ima 5713 . . . . 5 (𝑓 𝐷) = ran (𝑓 𝐷)
54uneq1i 4187 . . . 4 ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
61, 3, 53eqtr4i 2778 . . 3 ran 𝐻 = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
7 sbthlem.1 . . . . . 6 𝐴 ∈ V
8 sbthlem.2 . . . . . 6 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
97, 8sbthlem4 9152 . . . . 5 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝑔 “ (𝐴 𝐷)) = (𝐵 ∖ (𝑓 𝐷)))
10 df-ima 5713 . . . . 5 (𝑔 “ (𝐴 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷))
119, 10eqtr3di 2795 . . . 4 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝐵 ∖ (𝑓 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷)))
1211uneq2d 4191 . . 3 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))))
136, 12eqtr4id 2799 . 2 (((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ran 𝐻 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
14 imassrn 6100 . . . 4 (𝑓 𝐷) ⊆ ran 𝑓
15 sstr2 4015 . . . 4 ((𝑓 𝐷) ⊆ ran 𝑓 → (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵))
1614, 15ax-mp 5 . . 3 (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵)
17 undif 4505 . . 3 ((𝑓 𝐷) ⊆ 𝐵 ↔ ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
1816, 17sylib 218 . 2 (ran 𝑓𝐵 → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
1913, 18sylan9eqr 2802 1 ((ran 𝑓𝐵 ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝐻 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  {cab 2717  Vcvv 3488  cdif 3973  cun 3974  wss 3976   cuni 4931  ccnv 5699  dom cdm 5700  ran crn 5701  cres 5702  cima 5703  Fun wfun 6567
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-fun 6575
This theorem is referenced by:  sbthlem9  9157
  Copyright terms: Public domain W3C validator