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

Theorem sbthlemi3 6952
Description: Lemma for isbth 6960. (Contributed by NM, 22-Mar-1998.)
Hypotheses
Ref Expression
sbthlem.1 𝐴 ∈ V
sbthlem.2 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
Assertion
Ref Expression
sbthlemi3 ((EXMID ∧ ran 𝑔𝐴) → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) = (𝐴 𝐷))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓   𝑥,𝑔
Allowed substitution hints:   𝐴(𝑓,𝑔)   𝐵(𝑓,𝑔)   𝐷(𝑓,𝑔)

Proof of Theorem sbthlemi3
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 sbthlem.1 . . . . . . 7 𝐴 ∈ V
2 sbthlem.2 . . . . . . 7 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
31, 2sbthlem2 6951 . . . . . 6 (ran 𝑔𝐴 → (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐷)
41, 2sbthlem1 6950 . . . . . 6 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
53, 4jctil 312 . . . . 5 (ran 𝑔𝐴 → ( 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐷))
6 eqss 3170 . . . . 5 ( 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ↔ ( 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ⊆ 𝐷))
75, 6sylibr 134 . . . 4 (ran 𝑔𝐴 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
87difeq2d 3253 . . 3 (ran 𝑔𝐴 → (𝐴 𝐷) = (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))))
98adantl 277 . 2 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 𝐷) = (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))))
10 imassrn 4977 . . . . 5 (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ ran 𝑔
11 sstr2 3162 . . . . 5 ((𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ ran 𝑔 → (ran 𝑔𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ 𝐴))
1210, 11ax-mp 5 . . . 4 (ran 𝑔𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ 𝐴)
13 exmidexmid 4193 . . . . . . 7 (EXMIDDECID 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
14 dcstab 844 . . . . . . 7 (DECID 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) → STAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
1513, 14syl 14 . . . . . 6 (EXMIDSTAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
1615alrimiv 1874 . . . . 5 (EXMID → ∀𝑦STAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
17 dfss4st 3368 . . . . 5 (∀𝑦STAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) → ((𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
1816, 17syl 14 . . . 4 (EXMID → ((𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
1912, 18imbitrid 154 . . 3 (EXMID → (ran 𝑔𝐴 → (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
2019imp 124 . 2 ((EXMID ∧ ran 𝑔𝐴) → (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
219, 20eqtr2d 2211 1 ((EXMID ∧ ran 𝑔𝐴) → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) = (𝐴 𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  STAB wstab 830  DECID wdc 834  wal 1351   = wceq 1353  wcel 2148  {cab 2163  Vcvv 2737  cdif 3126  wss 3129   cuni 3807  EXMIDwem 4191  ran crn 4624  cima 4626
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206
This theorem depends on definitions:  df-bi 117  df-stab 831  df-dc 835  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-exmid 4192  df-xp 4629  df-cnv 4631  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636
This theorem is referenced by:  sbthlemi4  6953  sbthlemi5  6954
  Copyright terms: Public domain W3C validator