| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbthlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for sbth 9095. (Contributed by NM, 22-Mar-1998.) |
| Ref | Expression |
|---|---|
| sbthlem.1 | ⊢ 𝐴 ∈ V |
| sbthlem.2 | ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} |
| Ref | Expression |
|---|---|
| sbthlem3 | ⊢ (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = (𝐴 ∖ ∪ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbthlem.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
| 2 | sbthlem.2 | . . . . . 6 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} | |
| 3 | 1, 2 | sbthlem2 9086 | . . . . 5 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷) |
| 4 | 1, 2 | sbthlem1 9085 | . . . . 5 ⊢ ∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) |
| 5 | 3, 4 | jctil 529 | . . . 4 ⊢ (ran 𝑔 ⊆ 𝐴 → (∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷)) |
| 6 | eqss 3946 | . . . 4 ⊢ (∪ 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ↔ (∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷)) | |
| 7 | 5, 6 | sylibr 237 | . . 3 ⊢ (ran 𝑔 ⊆ 𝐴 → ∪ 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) |
| 8 | 7 | difeq2d 4074 | . 2 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ ∪ 𝐷) = (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))))) |
| 9 | imassrn 6067 | . . . 4 ⊢ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ ran 𝑔 | |
| 10 | sstr2 3938 | . . . 4 ⊢ ((𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ ran 𝑔 → (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴)) | |
| 11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴) |
| 12 | dfss4 4215 | . . 3 ⊢ ((𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) | |
| 13 | 11, 12 | sylib 221 | . 2 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) |
| 14 | 8, 13 | eqtr2d 2796 | 1 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = (𝐴 ∖ ∪ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {cab 2738 Vcvv 3450 ∖ cdif 3896 ⊆ wss 3899 ∪ cuni 4867 ran crn 5656 “ cima 5658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-xp 5661 df-cnv 5663 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 |
| This theorem is used by: sbthlem4 9088 sbthlem5 9089 |
| Copyright terms: Public domain | W3C validator |