ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sbthlem7 GIF version

Theorem sbthlem7 7280
Description: Lemma for isbth 7284. (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
StepHypRef Expression
1 funres 5418 . . 3 (Fun 𝑓 → Fun (𝑓 𝐷))
2 funres 5418 . . 3 (Fun 𝑔 → Fun (𝑔 ↾ (𝐴 𝐷)))
3 dmres 5084 . . . . . . . . 9 dom (𝑓 𝐷) = ( 𝐷 ∩ dom 𝑓)
4 inss1 3451 . . . . . . . . 9 ( 𝐷 ∩ dom 𝑓) ⊆ 𝐷
53, 4eqsstri 3280 . . . . . . . 8 dom (𝑓 𝐷) ⊆ 𝐷
6 ssrin 3456 . . . . . . . 8 (dom (𝑓 𝐷) ⊆ 𝐷 → (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) ⊆ ( 𝐷 ∩ dom (𝑔 ↾ (𝐴 𝐷))))
75, 6ax-mp 5 . . . . . . 7 (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) ⊆ ( 𝐷 ∩ dom (𝑔 ↾ (𝐴 𝐷)))
8 dmres 5084 . . . . . . . . 9 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ dom 𝑔)
9 inss1 3451 . . . . . . . . 9 ((𝐴 𝐷) ∩ dom 𝑔) ⊆ (𝐴 𝐷)
108, 9eqsstri 3280 . . . . . . . 8 dom (𝑔 ↾ (𝐴 𝐷)) ⊆ (𝐴 𝐷)
11 sslin 3457 . . . . . . . 8 (dom (𝑔 ↾ (𝐴 𝐷)) ⊆ (𝐴 𝐷) → ( 𝐷 ∩ dom (𝑔 ↾ (𝐴 𝐷))) ⊆ ( 𝐷 ∩ (𝐴 𝐷)))
1210, 11ax-mp 5 . . . . . . 7 ( 𝐷 ∩ dom (𝑔 ↾ (𝐴 𝐷))) ⊆ ( 𝐷 ∩ (𝐴 𝐷))
137, 12sstri 3257 . . . . . 6 (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) ⊆ ( 𝐷 ∩ (𝐴 𝐷))
14 disjdif 3599 . . . . . 6 ( 𝐷 ∩ (𝐴 𝐷)) = ∅
1513, 14sseqtri 3282 . . . . 5 (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) ⊆ ∅
16 ss0 3563 . . . . 5 ((dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) ⊆ ∅ → (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ∅)
1715, 16ax-mp 5 . . . 4 (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ∅
18 funun 5422 . . . 4 (((Fun (𝑓 𝐷) ∧ Fun (𝑔 ↾ (𝐴 𝐷))) ∧ (dom (𝑓 𝐷) ∩ dom (𝑔 ↾ (𝐴 𝐷))) = ∅) → Fun ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))))
1917, 18mpan2 429 . . 3 ((Fun (𝑓 𝐷) ∧ Fun (𝑔 ↾ (𝐴 𝐷))) → Fun ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))))
201, 2, 19syl2an 289 . 2 ((Fun 𝑓 ∧ Fun 𝑔) → Fun ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))))
21 sbthlem.3 . . 3 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
2221funeqi 5398 . 2 (Fun 𝐻 ↔ Fun ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))))
2320, 22sylibr 134 1 ((Fun 𝑓 ∧ Fun 𝑔) → Fun 𝐻)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  {cab 2224  Vcvv 2821  cdif 3217  cun 3218  cin 3219  wss 3220  c0 3520   cuni 3935  ccnv 4773  dom cdm 4774  cres 4776  cima 4777  Fun wfun 5371
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-res 4786  df-fun 5379
This theorem is used by:  sbthlemi9  7282
  Copyright terms: Public domain W3C validator