Theorem sbthlem7 9150

Description: Lemma for sbth 9154. (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 6610	. . 3 ⊢ (Fun 𝑓 → Fun (𝑓 ↾ ∪ 𝐷))
2		funres 6610	. . 3 ⊢ (Fun ◡𝑔 → Fun (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
3		dmres 6020	. . . . . . . . 9 ⊢ dom (𝑓 ↾ ∪ 𝐷) = (∪ 𝐷 ∩ dom 𝑓)
4		inss1 4136	. . . . . . . . 9 ⊢ (∪ 𝐷 ∩ dom 𝑓) ⊆ ∪ 𝐷
5	3, 4	eqsstri 3959	. . . . . . . 8 ⊢ dom (𝑓 ↾ ∪ 𝐷) ⊆ ∪ 𝐷
6		ssrin 4141	. . . . . . . 8 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ⊆ ∪ 𝐷 → (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))))
7	5, 6	ax-mp 5	. . . . . . 7 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
8		dmres 6020	. . . . . . . . 9 ⊢ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) = ((𝐴 ∖ ∪ 𝐷) ∩ dom ◡𝑔)
9		inss1 4136	. . . . . . . . 9 ⊢ ((𝐴 ∖ ∪ 𝐷) ∩ dom ◡𝑔) ⊆ (𝐴 ∖ ∪ 𝐷)
10	8, 9	eqsstri 3959	. . . . . . . 8 ⊢ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ⊆ (𝐴 ∖ ∪ 𝐷)
11		sslin 4142	. . . . . . . 8 ⊢ (dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) ⊆ (𝐴 ∖ ∪ 𝐷) → (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷)))
12	10, 11	ax-mp 5	. . . . . . 7 ⊢ (∪ 𝐷 ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷))
13	7, 12	sstri 3922	. . . . . 6 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷))
14		disjdif 4429	. . . . . 6 ⊢ (∪ 𝐷 ∩ (𝐴 ∖ ∪ 𝐷)) = ∅
15	13, 14	sseqtri 3961	. . . . 5 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ ∅
16		ss0 4355	. . . . 5 ⊢ ((dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) ⊆ ∅ → (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = ∅)
17	15, 16	ax-mp 5	. . . 4 ⊢ (dom (𝑓 ↾ ∪ 𝐷) ∩ dom (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = ∅
18		funun 6614	. . . 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 6588	. 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 2147  {cab 2741  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  ∪ cuni 4872  ^◡ccnv 5657  dom cdm 5658   ↾ cres 5660   “ cima 5661  Fun wfun 6560

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-res 5670  df-fun 6568

This theorem is used by:  sbthlem9  9152