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

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

Proof of Theorem sbthlemi6
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 simpll 527 . . 3 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → EXMID)
2 simprll 539 . . 3 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → dom 𝑔 = 𝐵)
3 simprlr 540 . . 3 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝑔𝐴)
4 simprr 533 . . 3 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → Fun 𝑔)
5 rnun 5176 . . . . 5 ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
6 sbthlem.3 . . . . . 6 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
76rneqi 4990 . . . . 5 ran 𝐻 = ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
8 df-ima 4767 . . . . . 6 (𝑓 𝐷) = ran (𝑓 𝐷)
98uneq1i 3373 . . . . 5 ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
105, 7, 93eqtr4i 2265 . . . 4 ran 𝐻 = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
11 sbthlem.1 . . . . . . 7 𝐴 ∈ V
12 sbthlem.2 . . . . . . 7 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1311, 12sbthlemi4 7243 . . . . . 6 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝑔 “ (𝐴 𝐷)) = (𝐵 ∖ (𝑓 𝐷)))
14 df-ima 4767 . . . . . 6 (𝑔 “ (𝐴 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷))
1513, 14eqtr3di 2282 . . . . 5 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝐵 ∖ (𝑓 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷)))
1615uneq2d 3377 . . . 4 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))))
1710, 16eqtr4id 2286 . . 3 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ran 𝐻 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
181, 2, 3, 4, 17syl121anc 1279 . 2 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝐻 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
19 imassrn 5117 . . . . . . 7 (𝑓 𝐷) ⊆ ran 𝑓
20 sstr2 3249 . . . . . . 7 ((𝑓 𝐷) ⊆ ran 𝑓 → (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵))
2119, 20ax-mp 5 . . . . . 6 (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵)
2221adantl 277 . . . . 5 ((EXMID ∧ ran 𝑓𝐵) → (𝑓 𝐷) ⊆ 𝐵)
23 undifdcss 7196 . . . . . . 7 (𝐵 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) ↔ ((𝑓 𝐷) ⊆ 𝐵 ∧ ∀𝑦𝐵 DECID 𝑦 ∈ (𝑓 𝐷)))
24 exmidexmid 4314 . . . . . . . . 9 (EXMIDDECID 𝑦 ∈ (𝑓 𝐷))
2524ralrimivw 2618 . . . . . . . 8 (EXMID → ∀𝑦𝐵 DECID 𝑦 ∈ (𝑓 𝐷))
2625biantrud 304 . . . . . . 7 (EXMID → ((𝑓 𝐷) ⊆ 𝐵 ↔ ((𝑓 𝐷) ⊆ 𝐵 ∧ ∀𝑦𝐵 DECID 𝑦 ∈ (𝑓 𝐷))))
2723, 26bitr4id 199 . . . . . 6 (EXMID → (𝐵 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) ↔ (𝑓 𝐷) ⊆ 𝐵))
2827adantr 276 . . . . 5 ((EXMID ∧ ran 𝑓𝐵) → (𝐵 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) ↔ (𝑓 𝐷) ⊆ 𝐵))
2922, 28mpbird 167 . . . 4 ((EXMID ∧ ran 𝑓𝐵) → 𝐵 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
3029eqcomd 2240 . . 3 ((EXMID ∧ ran 𝑓𝐵) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
3130adantr 276 . 2 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
3218, 31eqtrd 2267 1 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝐻 = 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  DECID wdc 842  w3a 1005   = wceq 1398  wcel 2205  {cab 2220  wral 2522  Vcvv 2815  cdif 3211  cun 3212  wss 3214   cuni 3919  EXMIDwem 4312  ccnv 4753  dom cdm 4754  ran crn 4755  cres 4756  cima 4757  Fun wfun 5351
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 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327
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 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-exmid 4313  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-fun 5359
This theorem is referenced by:  sbthlemi9  7248
  Copyright terms: Public domain W3C validator