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

Theorem sbthlemi6 7028
Description: Lemma for isbth 7033. (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 537 . . 3 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → dom 𝑔 = 𝐵)
3 simprlr 538 . . 3 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝑔𝐴)
4 simprr 531 . . 3 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → Fun 𝑔)
5 rnun 5078 . . . . 5 ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
6 sbthlem.3 . . . . . 6 𝐻 = ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
76rneqi 4894 . . . . 5 ran 𝐻 = ran ((𝑓 𝐷) ∪ (𝑔 ↾ (𝐴 𝐷)))
8 df-ima 4676 . . . . . 6 (𝑓 𝐷) = ran (𝑓 𝐷)
98uneq1i 3313 . . . . 5 ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))) = (ran (𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
105, 7, 93eqtr4i 2227 . . . 4 ran 𝐻 = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷)))
11 sbthlem.1 . . . . . . 7 𝐴 ∈ V
12 sbthlem.2 . . . . . . 7 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
1311, 12sbthlemi4 7026 . . . . . 6 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝑔 “ (𝐴 𝐷)) = (𝐵 ∖ (𝑓 𝐷)))
14 df-ima 4676 . . . . . 6 (𝑔 “ (𝐴 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷))
1513, 14eqtr3di 2244 . . . . 5 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → (𝐵 ∖ (𝑓 𝐷)) = ran (𝑔 ↾ (𝐴 𝐷)))
1615uneq2d 3317 . . . 4 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = ((𝑓 𝐷) ∪ ran (𝑔 ↾ (𝐴 𝐷))))
1710, 16eqtr4id 2248 . . 3 ((EXMID ∧ (dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔) → ran 𝐻 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
181, 2, 3, 4, 17syl121anc 1254 . 2 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝐻 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))))
19 imassrn 5020 . . . . . . 7 (𝑓 𝐷) ⊆ ran 𝑓
20 sstr2 3190 . . . . . . 7 ((𝑓 𝐷) ⊆ ran 𝑓 → (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵))
2119, 20ax-mp 5 . . . . . 6 (ran 𝑓𝐵 → (𝑓 𝐷) ⊆ 𝐵)
2221adantl 277 . . . . 5 ((EXMID ∧ ran 𝑓𝐵) → (𝑓 𝐷) ⊆ 𝐵)
23 undifdcss 6984 . . . . . . 7 (𝐵 = ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) ↔ ((𝑓 𝐷) ⊆ 𝐵 ∧ ∀𝑦𝐵 DECID 𝑦 ∈ (𝑓 𝐷)))
24 exmidexmid 4229 . . . . . . . . 9 (EXMIDDECID 𝑦 ∈ (𝑓 𝐷))
2524ralrimivw 2571 . . . . . . . 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 2202 . . 3 ((EXMID ∧ ran 𝑓𝐵) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
3130adantr 276 . 2 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ((𝑓 𝐷) ∪ (𝐵 ∖ (𝑓 𝐷))) = 𝐵)
3218, 31eqtrd 2229 1 (((EXMID ∧ ran 𝑓𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔𝐴) ∧ Fun 𝑔)) → ran 𝐻 = 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  DECID wdc 835  w3a 980   = wceq 1364  wcel 2167  {cab 2182  wral 2475  Vcvv 2763  cdif 3154  cun 3155  wss 3157   cuni 3839  EXMIDwem 4227  ccnv 4662  dom cdm 4663  ran crn 4664  cres 4665  cima 4666  Fun wfun 5252
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-exmid 4228  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-fun 5260
This theorem is referenced by:  sbthlemi9  7031
  Copyright terms: Public domain W3C validator