Theorem sbthlem5 8615

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

Step	Hyp	Ref	Expression
1		sbthlem.3	. . . . 5 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
2	1	dmeqi 5737	. . . 4 ⊢ dom 𝐻 = dom ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
3		dmun 5743	. . . . 5 ⊢ dom ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = (dom (𝑓 ↾ ∪ 𝐷) ∪ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
4		dmres 5840	. . . . . 6 ⊢ dom (𝑓 ↾ ∪ 𝐷) = (∪ 𝐷 ∩ dom 𝑓)
5		dmres 5840	. . . . . . 7 ⊢ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) = ((𝐴 ∖ ∪ 𝐷) ∩ dom ◡𝑔)
6		df-rn 5530	. . . . . . . . 9 ⊢ ran 𝑔 = dom ◡𝑔
7	6	eqcomi 2807	. . . . . . . 8 ⊢ dom ◡𝑔 = ran 𝑔
8	7	ineq2i 4136	. . . . . . 7 ⊢ ((𝐴 ∖ ∪ 𝐷) ∩ dom ◡𝑔) = ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔)
9	5, 8	eqtri 2821	. . . . . 6 ⊢ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) = ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔)
10	4, 9	uneq12i 4088	. . . . 5 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∪ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = ((∪ 𝐷 ∩ dom 𝑓) ∪ ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔))
11	3, 10	eqtri 2821	. . . 4 ⊢ dom ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = ((∪ 𝐷 ∩ dom 𝑓) ∪ ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔))
12	2, 11	eqtri 2821	. . 3 ⊢ dom 𝐻 = ((∪ 𝐷 ∩ dom 𝑓) ∪ ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔))
13		sbthlem.1	. . . . . . . . 9 ⊢ 𝐴 ∈ V
14		sbthlem.2	. . . . . . . . 9 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
15	13, 14	sbthlem1 8611	. . . . . . . 8 ⊢ ∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
16		difss 4059	. . . . . . . 8 ⊢ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ 𝐴
17	15, 16	sstri 3924	. . . . . . 7 ⊢ ∪ 𝐷 ⊆ 𝐴
18		sseq2 3941	. . . . . . 7 ⊢ (dom 𝑓 = 𝐴 → (∪ 𝐷 ⊆ dom 𝑓 ↔ ∪ 𝐷 ⊆ 𝐴))
19	17, 18	mpbiri 261	. . . . . 6 ⊢ (dom 𝑓 = 𝐴 → ∪ 𝐷 ⊆ dom 𝑓)
20		dfss 3899	. . . . . 6 ⊢ (∪ 𝐷 ⊆ dom 𝑓 ↔ ∪ 𝐷 = (∪ 𝐷 ∩ dom 𝑓))
21	19, 20	sylib 221	. . . . 5 ⊢ (dom 𝑓 = 𝐴 → ∪ 𝐷 = (∪ 𝐷 ∩ dom 𝑓))
22	21	uneq1d 4089	. . . 4 ⊢ (dom 𝑓 = 𝐴 → (∪ 𝐷 ∪ (𝐴 ∖ ∪ 𝐷)) = ((∪ 𝐷 ∩ dom 𝑓) ∪ (𝐴 ∖ ∪ 𝐷)))
23	13, 14	sbthlem3 8613	. . . . . . 7 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = (𝐴 ∖ ∪ 𝐷))
24		imassrn 5907	. . . . . . 7 ⊢ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ ran 𝑔
25	23, 24	eqsstrrdi 3970	. . . . . 6 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ ∪ 𝐷) ⊆ ran 𝑔)
26		dfss 3899	. . . . . 6 ⊢ ((𝐴 ∖ ∪ 𝐷) ⊆ ran 𝑔 ↔ (𝐴 ∖ ∪ 𝐷) = ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔))
27	25, 26	sylib 221	. . . . 5 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ ∪ 𝐷) = ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔))
28	27	uneq2d 4090	. . . 4 ⊢ (ran 𝑔 ⊆ 𝐴 → ((∪ 𝐷 ∩ dom 𝑓) ∪ (𝐴 ∖ ∪ 𝐷)) = ((∪ 𝐷 ∩ dom 𝑓) ∪ ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔)))
29	22, 28	sylan9eq 2853	. . 3 ⊢ ((dom 𝑓 = 𝐴 ∧ ran 𝑔 ⊆ 𝐴) → (∪ 𝐷 ∪ (𝐴 ∖ ∪ 𝐷)) = ((∪ 𝐷 ∩ dom 𝑓) ∪ ((𝐴 ∖ ∪ 𝐷) ∩ ran 𝑔)))
30	12, 29	eqtr4id 2852	. 2 ⊢ ((dom 𝑓 = 𝐴 ∧ ran 𝑔 ⊆ 𝐴) → dom 𝐻 = (∪ 𝐷 ∪ (𝐴 ∖ ∪ 𝐷)))
31		undif 4388	. . 3 ⊢ (∪ 𝐷 ⊆ 𝐴 ↔ (∪ 𝐷 ∪ (𝐴 ∖ ∪ 𝐷)) = 𝐴)
32	17, 31	mpbi 233	. 2 ⊢ (∪ 𝐷 ∪ (𝐴 ∖ ∪ 𝐷)) = 𝐴
33	30, 32	eqtrdi 2849	1 ⊢ ((dom 𝑓 = 𝐴 ∧ ran 𝑔 ⊆ 𝐴) → dom 𝐻 = 𝐴)

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  {cab 2776  Vcvv 3441   ∖ cdif 3878   ∪ cun 3879   ∩ cin 3880   ⊆ wss 3881  ∪ cuni 4800  ^◡ccnv 5518  dom cdm 5519  ran crn 5520   ↾ cres 5521   “ cima 5522

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 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

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 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-xp 5525  df-cnv 5527  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532

This theorem is referenced by:  sbthlem9  8619