Theorem sbthlem7 9095

Description: Lemma for sbth 9099. (Contributed by NM, 27-Mar-1998.)

Hypotheses

Ref	Expression
sbthlem.1	⊢ 𝐴 ∈ V
sbthlem.2	⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
sbthlem.3	⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))

Assertion

Ref	Expression
sbthlem7	⊢ ((Fun 𝑓 ∧ Fun ◡𝑔) → Fun 𝐻)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓   𝑥,𝑔   𝑥,𝐻

Allowed substitution hints:   𝐴(𝑓, 𝑔)   𝐵(𝑓, 𝑔)   𝐷(𝑓, 𝑔)   𝐻(𝑓, 𝑔)

Proof of Theorem sbthlem7

Step	Hyp	Ref	Expression
1		funres 6579	. . 3 ⊢ (Fun 𝑓 → Fun (𝑓 ↾ ∪ 𝐷))
2		funres 6579	. . 3 ⊢ (Fun ◡𝑔 → Fun (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
3		dmres 6009	. . . . . . . . 9 ⊢ dom (𝑓 ↾ ∪ 𝐷) = (∪ 𝐷 ∩ dom 𝑓)
4		inss1 4185	. . . . . . . . 9 ⊢ (∪ 𝐷 ∩ dom 𝑓) ⊆ ∪ 𝐷
5	3, 4	eqsstri 3980	. . . . . . . 8 ⊢ dom (𝑓 ↾ ∪ 𝐷) ⊆ ∪ 𝐷
6		ssrin 4190	. . . . . . . 8 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ⊆ ∪ 𝐷 → (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))))
7	5, 6	ax-mp 5	. . . . . . 7 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
8		dmres 6009	. . . . . . . . 9 ⊢ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) = ((𝐴 ∖ ∪ 𝐷) ∩ dom ◡𝑔)
9		inss1 4185	. . . . . . . . 9 ⊢ ((𝐴 ∖ ∪ 𝐷) ∩ dom ◡𝑔) ⊆ (𝐴 ∖ ∪ 𝐷)
10	8, 9	eqsstri 3980	. . . . . . . 8 ⊢ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ⊆ (𝐴 ∖ ∪ 𝐷)
11		sslin 4191	. . . . . . . 8 ⊢ (dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ⊆ (𝐴 ∖ ∪ 𝐷) → (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷)))
12	10, 11	ax-mp 5	. . . . . . 7 ⊢ (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷))
13	7, 12	sstri 3943	. . . . . 6 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷))
14		disjdif 4429	. . . . . 6 ⊢ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷)) = ∅
15	13, 14	sseqtri 3982	. . . . 5 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ ∅
16		ss0 4355	. . . . 5 ⊢ ((dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ ∅ → (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = ∅)
17	15, 16	ax-mp 5	. . . 4 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = ∅
18		funun 6583	. . . 4 ⊢ (((Fun (𝑓 ↾ ∪ 𝐷) ∧ Fun (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ∧ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = ∅) → Fun ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))))
19	17, 18	mpan2 704	. . 3 ⊢ ((Fun (𝑓 ↾ ∪ 𝐷) ∧ Fun (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) → Fun ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))))
20	1, 2, 19	syl2an 608	. 2 ⊢ ((Fun 𝑓 ∧ Fun ◡𝑔) → Fun ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))))
21		sbthlem.3	. . 3 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
22	21	funeqi 6558	. 2 ⊢ (Fun 𝐻 ↔ Fun ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))))
23	20, 22	sylibr 237	1 ⊢ ((Fun 𝑓 ∧ Fun ◡𝑔) → Fun 𝐻)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2740  Vcvv 3453   ∖ cdif 3899   ∪ cun 3900   ∩ cin 3901   ⊆ wss 3902  ∅c0 4282  ∪ cuni 4870  ^◡ccnv 5658  dom cdm 5659   ↾ cres 5661   “ cima 5662  Fun wfun 6531

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-res 5671  df-fun 6539

This theorem is used by:  sbthlem9  9097