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

Theorem sbthlemi5 7062
Description: Lemma for isbth 7068. (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 4878 . . . 4 dom 𝐻 = dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
3 dmun 4884 . . . 4 dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷)))
4 dmres 4979 . . . . 5 dom (𝑓 𝐷) = ( 𝐷 ∩ dom 𝑓)
5 dmres 4979 . . . . . 6 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ dom 𝑔)
6 df-rn 4685 . . . . . . . 8 ran 𝑔 = dom 𝑔
76eqcomi 2208 . . . . . . 7 dom 𝑔 = ran 𝑔
87ineq2i 3370 . . . . . 6 ((𝐴 𝐷) ∩ dom 𝑔) = ((𝐴 𝐷) ∩ ran 𝑔)
95, 8eqtri 2225 . . . . 5 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ ran 𝑔)
104, 9uneq12i 3324 . . . 4 (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷))) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
112, 3, 103eqtri 2229 . . 3 dom 𝐻 = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
12 sbthlem.1 . . . . . . . . . 10 𝐴 ∈ V
13 sbthlem.2 . . . . . . . . . 10 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1412, 13sbthlem1 7058 . . . . . . . . 9 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
15 difss 3298 . . . . . . . . 9 (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐴
1614, 15sstri 3201 . . . . . . . 8 𝐷𝐴
17 sseq2 3216 . . . . . . . 8 (dom 𝑓 = 𝐴 → ( 𝐷 ⊆ dom 𝑓 𝐷𝐴))
1816, 17mpbiri 168 . . . . . . 7 (dom 𝑓 = 𝐴 𝐷 ⊆ dom 𝑓)
19 dfss 3179 . . . . . . 7 ( 𝐷 ⊆ dom 𝑓 𝐷 = ( 𝐷 ∩ dom 𝑓))
2018, 19sylib 122 . . . . . 6 (dom 𝑓 = 𝐴 𝐷 = ( 𝐷 ∩ dom 𝑓))
2120uneq1d 3325 . . . . 5 (dom 𝑓 = 𝐴 → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)))
2212, 13sbthlemi3 7060 . . . . . . . 8 ((EXMID ∧ ran 𝑔𝐴) → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) = (𝐴 𝐷))
23 imassrn 5032 . . . . . . . 8 (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ ran 𝑔
2422, 23eqsstrrdi 3245 . . . . . . 7 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 𝐷) ⊆ ran 𝑔)
25 dfss 3179 . . . . . . 7 ((𝐴 𝐷) ⊆ ran 𝑔 ↔ (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2624, 25sylib 122 . . . . . 6 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2726uneq2d 3326 . . . . 5 ((EXMID ∧ ran 𝑔𝐴) → (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2821, 27sylan9eq 2257 . . . 4 ((dom 𝑓 = 𝐴 ∧ (EXMID ∧ ran 𝑔𝐴)) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2928an12s 565 . . 3 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
3011, 29eqtr4id 2256 . 2 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → dom 𝐻 = ( 𝐷 ∪ (𝐴 𝐷)))
31 undifdcss 7019 . . . . 5 (𝐴 = ( 𝐷 ∪ (𝐴 𝐷)) ↔ ( 𝐷𝐴 ∧ ∀𝑦𝐴 DECID 𝑦 𝐷))
32 exmidexmid 4239 . . . . . . 7 (EXMIDDECID 𝑦 𝐷)
3332ralrimivw 2579 . . . . . 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 2240 1 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → dom 𝐻 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 835   = wceq 1372  wcel 2175  {cab 2190  wral 2483  Vcvv 2771  cdif 3162  cun 3163  cin 3164  wss 3165   cuni 3849  EXMIDwem 4237  ccnv 4673  dom cdm 4674  ran crn 4675  cres 4676  cima 4677
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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-rab 2492  df-v 2773  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-exmid 4238  df-xp 4680  df-cnv 4682  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687
This theorem is referenced by:  sbthlemi9  7066
  Copyright terms: Public domain W3C validator