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

Theorem sbthlemi5 7022
Description: Lemma for isbth 7028. (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 4864 . . . 4 dom 𝐻 = dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
3 dmun 4870 . . . 4 dom ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷)))
4 dmres 4964 . . . . 5 dom (𝑓 𝐷) = ( 𝐷 ∩ dom 𝑓)
5 dmres 4964 . . . . . 6 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ dom 𝑔)
6 df-rn 4671 . . . . . . . 8 ran 𝑔 = dom 𝑔
76eqcomi 2197 . . . . . . 7 dom 𝑔 = ran 𝑔
87ineq2i 3358 . . . . . 6 ((𝐴 𝐷) ∩ dom 𝑔) = ((𝐴 𝐷) ∩ ran 𝑔)
95, 8eqtri 2214 . . . . 5 dom (𝑔 ↾ (𝐴 𝐷)) = ((𝐴 𝐷) ∩ ran 𝑔)
104, 9uneq12i 3312 . . . 4 (dom (𝑓 𝐷) ∪ dom (𝑔 ↾ (𝐴 𝐷))) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
112, 3, 103eqtri 2218 . . 3 dom 𝐻 = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔))
12 sbthlem.1 . . . . . . . . . 10 𝐴 ∈ V
13 sbthlem.2 . . . . . . . . . 10 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1412, 13sbthlem1 7018 . . . . . . . . 9 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
15 difss 3286 . . . . . . . . 9 (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐴
1614, 15sstri 3189 . . . . . . . 8 𝐷𝐴
17 sseq2 3204 . . . . . . . 8 (dom 𝑓 = 𝐴 → ( 𝐷 ⊆ dom 𝑓 𝐷𝐴))
1816, 17mpbiri 168 . . . . . . 7 (dom 𝑓 = 𝐴 𝐷 ⊆ dom 𝑓)
19 dfss 3168 . . . . . . 7 ( 𝐷 ⊆ dom 𝑓 𝐷 = ( 𝐷 ∩ dom 𝑓))
2018, 19sylib 122 . . . . . 6 (dom 𝑓 = 𝐴 𝐷 = ( 𝐷 ∩ dom 𝑓))
2120uneq1d 3313 . . . . 5 (dom 𝑓 = 𝐴 → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)))
2212, 13sbthlemi3 7020 . . . . . . . 8 ((EXMID ∧ ran 𝑔𝐴) → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) = (𝐴 𝐷))
23 imassrn 5017 . . . . . . . 8 (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ ran 𝑔
2422, 23eqsstrrdi 3233 . . . . . . 7 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 𝐷) ⊆ ran 𝑔)
25 dfss 3168 . . . . . . 7 ((𝐴 𝐷) ⊆ ran 𝑔 ↔ (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2624, 25sylib 122 . . . . . 6 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 𝐷) = ((𝐴 𝐷) ∩ ran 𝑔))
2726uneq2d 3314 . . . . 5 ((EXMID ∧ ran 𝑔𝐴) → (( 𝐷 ∩ dom 𝑓) ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2821, 27sylan9eq 2246 . . . 4 ((dom 𝑓 = 𝐴 ∧ (EXMID ∧ ran 𝑔𝐴)) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
2928an12s 565 . . 3 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → ( 𝐷 ∪ (𝐴 𝐷)) = (( 𝐷 ∩ dom 𝑓) ∪ ((𝐴 𝐷) ∩ ran 𝑔)))
3011, 29eqtr4id 2245 . 2 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → dom 𝐻 = ( 𝐷 ∪ (𝐴 𝐷)))
31 undifdcss 6981 . . . . 5 (𝐴 = ( 𝐷 ∪ (𝐴 𝐷)) ↔ ( 𝐷𝐴 ∧ ∀𝑦𝐴 DECID 𝑦 𝐷))
32 exmidexmid 4226 . . . . . . 7 (EXMIDDECID 𝑦 𝐷)
3332ralrimivw 2568 . . . . . 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 2229 1 ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔𝐴)) → dom 𝐻 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 835   = wceq 1364  wcel 2164  {cab 2179  wral 2472  Vcvv 2760  cdif 3151  cun 3152  cin 3153  wss 3154   cuni 3836  EXMIDwem 4224  ccnv 4659  dom cdm 4660  ran crn 4661  cres 4662  cima 4663
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-exmid 4225  df-xp 4666  df-cnv 4668  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673
This theorem is referenced by:  sbthlemi9  7026
  Copyright terms: Public domain W3C validator