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

Theorem sbthlemi6 7232
Description: Lemma for isbth 7237. (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 5171 . . . . 5 ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
6 sbthlem.3 . . . . . 6 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
76rneqi 4985 . . . . 5 ran 𝐻 = ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
8 df-ima 4762 . . . . . 6 (𝑓 𝐷) = ran (𝑓 𝐷)
98uneq1i 3369 . . . . 5 ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
105, 7, 93eqtr4i 2263 . . . 4 ran 𝐻 = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
11 sbthlem.1 . . . . . . 7 𝐴 ∈ V
12 sbthlem.2 . . . . . . 7 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1311, 12sbthlemi4 7230 . . . . . 6 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝑔 “ (𝐴 𝐷)) = (𝐵 ∖ (𝑓 𝐷)))
14 df-ima 4762 . . . . . 6 (𝑔 “ (𝐴 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷))
1513, 14eqtr3di 2280 . . . . 5 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝐵 ∖ (𝑓 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷)))
1615uneq2d 3373 . . . 4 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))))
1710, 16eqtr4id 2284 . . 3 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ran 𝐻 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
181, 2, 3, 4, 17syl121anc 1279 . 2 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝐻 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
19 imassrn 5112 . . . . . . 7 (𝑓 𝐷) ⊆ ran 𝑓
20 sstr2 3245 . . . . . . 7 ((𝑓 𝐷) ⊆ ran 𝑓 → (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵))
2119, 20ax-mp 5 . . . . . 6 (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵)
2221adantl 277 . . . . 5 ((EXMID ∧ ran 𝑓𝐵) → (𝑓 𝐷) ⊆ 𝐵)
23 undifdcss 7183 . . . . . . 7 (𝐵 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) ↔ ((𝑓 𝐷) ⊆ 𝐵 ∧ ∀𝑦𝐵 DECID 𝑦 ∈ (𝑓 𝐷)))
24 exmidexmid 4309 . . . . . . . . 9 (EXMIDDECID 𝑦 ∈ (𝑓 𝐷))
2524ralrimivw 2616 . . . . . . . 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 2238 . . 3 ((EXMID ∧ ran 𝑓𝐵) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
3130adantr 276 . 2 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
3218, 31eqtrd 2265 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 2203  {cab 2218  wral 2520  Vcvv 2813  cdif 3208  cun 3209  wss 3211   cuni 3914  EXMIDwem 4307  ccnv 4748  dom cdm 4749  ran crn 4750  cres 4751  cima 4752  Fun wfun 5346
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 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-exmid 4308  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-fun 5354
This theorem is referenced by:  sbthlemi9  7235
  Copyright terms: Public domain W3C validator