Theorem sbthlem6 8635

Description: Lemma for sbth 8640. (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

Step	Hyp	Ref	Expression
1		df-ima 5571	. . . . 5 ⊢ (◡𝑔 “ (𝐴 ∖ ∪ 𝐷)) = ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))
2		sbthlem.1	. . . . . 6 ⊢ 𝐴 ∈ V
3		sbthlem.2	. . . . . 6 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
4	2, 3	sbthlem4 8633	. . . . 5 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → (◡𝑔 “ (𝐴 ∖ ∪ 𝐷)) = (𝐵 ∖ (𝑓 “ ∪ 𝐷)))
5	1, 4	syl5reqr 2874	. . . 4 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → (𝐵 ∖ (𝑓 “ ∪ 𝐷)) = ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
6	5	uneq2d 4142	. . 3 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))))
7		rnun 6007	. . . 4 ⊢ ran ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = (ran (𝑓 ↾ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
8		sbthlem.3	. . . . 5 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
9	8	rneqi 5810	. . . 4 ⊢ ran 𝐻 = ran ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
10		df-ima 5571	. . . . 5 ⊢ (𝑓 “ ∪ 𝐷) = ran (𝑓 ↾ ∪ 𝐷)
11	10	uneq1i 4138	. . . 4 ⊢ ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = (ran (𝑓 ↾ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
12	7, 9, 11	3eqtr4i 2857	. . 3 ⊢ ran 𝐻 = ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
13	6, 12	syl6reqr 2878	. 2 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → ran 𝐻 = ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
14		imassrn 5943	. . . 4 ⊢ (𝑓 “ ∪ 𝐷) ⊆ ran 𝑓
15		sstr2 3977	. . . 4 ⊢ ((𝑓 “ ∪ 𝐷) ⊆ ran 𝑓 → (ran 𝑓 ⊆ 𝐵 → (𝑓 “ ∪ 𝐷) ⊆ 𝐵))
16	14, 15	ax-mp 5	. . 3 ⊢ (ran 𝑓 ⊆ 𝐵 → (𝑓 “ ∪ 𝐷) ⊆ 𝐵)
17		undif 4433	. . 3 ⊢ ((𝑓 “ ∪ 𝐷) ⊆ 𝐵 ↔ ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = 𝐵)
18	16, 17	sylib 220	. 2 ⊢ (ran 𝑓 ⊆ 𝐵 → ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = 𝐵)
19	13, 18	sylan9eqr 2881	1 ⊢ ((ran 𝑓 ⊆ 𝐵 ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → ran 𝐻 = 𝐵)

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113  {cab 2802  Vcvv 3497   ∖ cdif 3936   ∪ cun 3937   ⊆ wss 3939  ∪ cuni 4841  ^◡ccnv 5557  dom cdm 5558  ran crn 5559   ↾ cres 5560   “ cima 5561  Fun wfun 6352

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-br 5070  df-opab 5132  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-fun 6360

This theorem is referenced by:  sbthlem9  8638