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

Theorem sbthlemi5 7245
Description: Lemma for isbth 7251. (Contributed by NM, 22-Mar-1998.)
Hypotheses
Ref Expression
sbthlem.1 𝐴 ∈ V
sbthlem.2 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
sbthlem.3 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
Assertion
Ref Expression
sbthlemi5 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → dom 𝐻 = 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓   𝑥,𝑔   𝑥,𝐻
Allowed substitution hints:   𝐴(𝑓,𝑔)   𝐵(𝑓,𝑔)   𝐷(𝑓,𝑔)   𝐻(𝑓,𝑔)

Proof of Theorem sbthlemi5
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 sbthlem.3 . . . . 5 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
21dmeqi 4963 . . . 4 dom 𝐻 = dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
3 dmun 4969 . . . 4 dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷)))
4 dmres 5065 . . . . 5 dom (𝑓 𝐷) = ( 𝐷 ∩ dom 𝑓)
5 dmres 5065 . . . . . 6 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ dom 𝑔)
6 df-rn 4766 . . . . . . . 8 ran 𝑔 = dom 𝑔
76eqcomi 2238 . . . . . . 7 dom 𝑔 = ran 𝑔
87ineq2i 3423 . . . . . 6 ((𝐴 𝐷) ∩ dom 𝑔) = ((𝐴 𝐷) ∩ ran 𝑔)
95, 8eqtri 2255 . . . . 5 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ ran 𝑔)
104, 9uneq12i 3375 . . . 4 (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷))) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
112, 3, 103eqtri 2259 . . 3 dom 𝐻 = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
12 sbthlem.1 . . . . . . . . . 10 𝐴 ∈ V
13 sbthlem.2 . . . . . . . . . 10 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1412, 13sbthlem1 7241 . . . . . . . . 9 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
15 difss 3349 . . . . . . . . 9 (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐴
1614, 15sstri 3251 . . . . . . . 8 𝐷𝐴
17 sseq2 3266 . . . . . . . 8 (dom 𝑓 = 𝐴 → ( 𝐷 ⊆ dom 𝑓 𝐷𝐴))
1816, 17mpbiri 168 . . . . . . 7 (dom 𝑓 = 𝐴 𝐷 ⊆ dom 𝑓)
19 dfss 3228 . . . . . . 7 ( 𝐷 ⊆ dom 𝑓 𝐷 = ( 𝐷 ∩ dom 𝑓))
2018, 19sylib 122 . . . . . 6 (dom 𝑓 = 𝐴 𝐷 = ( 𝐷 ∩ dom 𝑓))
2120uneq1d 3376 . . . . 5 (dom 𝑓 = 𝐴 → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)))
2212, 13sbthlemi3 7243 . . . . . . . 8 ((EXMID ∧ ran 𝑔𝐴) → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) = (𝐴 𝐷))
23 imassrn 5118 . . . . . . . 8 (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ ran 𝑔
2422, 23eqsstrrdi 3295 . . . . . . 7 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 𝐷) ⊆ ran 𝑔)
25 dfss 3228 . . . . . . 7 ((𝐴 𝐷) ⊆ ran 𝑔 ↔ (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2624, 25sylib 122 . . . . . 6 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2726uneq2d 3377 . . . . 5 ((EXMID ∧ ran 𝑔𝐴) → (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2821, 27sylan9eq 2287 . . . 4 ((dom 𝑓 = 𝐴 ∧ (EXMID ∧ ran 𝑔𝐴)) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2928an12s 567 . . 3 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
3011, 29eqtr4id 2286 . 2 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → dom 𝐻 = ( 𝐷 ∪ (𝐴 𝐷)))
31 undifdcss 7197 . . . . 5 (𝐴 = ( 𝐷 ∪ (𝐴 𝐷)) ↔ ( 𝐷𝐴 ∧ ∀𝑦𝐴 DECID 𝑦 𝐷))
32 exmidexmid 4315 . . . . . . 7 (EXMIDDECID 𝑦 𝐷)
3332ralrimivw 2618 . . . . . 6 (EXMID → ∀𝑦𝐴 DECID 𝑦 𝐷)
3433biantrud 304 . . . . 5 (EXMID → ( 𝐷𝐴 ↔ ( 𝐷𝐴 ∧ ∀𝑦𝐴 DECID 𝑦 𝐷)))
3531, 34bitr4id 199 . . . 4 (EXMID → (𝐴 = ( 𝐷 ∪ (𝐴 𝐷)) ↔ 𝐷𝐴))
3616, 35mpbiri 168 . . 3 (EXMID𝐴 = ( 𝐷 ∪ (𝐴 𝐷)))
3736adantr 276 . 2 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → 𝐴 = ( 𝐷 ∪ (𝐴 𝐷)))
3830, 37eqtr4d 2270 1 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → dom 𝐻 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 842   = wceq 1398  wcel 2205  {cab 2220  wral 2522  Vcvv 2815  cdif 3211  cun 3212  cin 3213  wss 3214   cuni 3920  EXMIDwem 4313  ccnv 4754  dom cdm 4755  ran crn 4756  cres 4757  cima 4758
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4234  ax-nul 4242  ax-pow 4293  ax-pr 4328
This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-br 4116  df-opab 4178  df-exmid 4314  df-xp 4761  df-cnv 4763  df-dm 4765  df-rn 4766  df-res 4767  df-ima 4768
This theorem is referenced by:  sbthlemi9  7249
  Copyright terms: Public domain W3C validator