![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sbthlem3 | Structured version Visualization version GIF version |
Description: Lemma for sbth 9138. (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 9129 | . . . . 5 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷) |
4 | 1, 2 | sbthlem1 9128 | . . . . 5 ⊢ ∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) |
5 | 3, 4 | jctil 519 | . . . 4 ⊢ (ran 𝑔 ⊆ 𝐴 → (∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷)) |
6 | eqss 4012 | . . . 4 ⊢ (∪ 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ↔ (∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷)) | |
7 | 5, 6 | sylibr 234 | . . 3 ⊢ (ran 𝑔 ⊆ 𝐴 → ∪ 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) |
8 | 7 | difeq2d 4137 | . 2 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ ∪ 𝐷) = (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))))) |
9 | imassrn 6093 | . . . 4 ⊢ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ ran 𝑔 | |
10 | sstr2 4003 | . . . 4 ⊢ ((𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ ran 𝑔 → (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴)) | |
11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴) |
12 | dfss4 4276 | . . 3 ⊢ ((𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) | |
13 | 11, 12 | sylib 218 | . 2 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) |
14 | 8, 13 | eqtr2d 2777 | 1 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = (𝐴 ∖ ∪ 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1538 ∈ wcel 2107 {cab 2713 Vcvv 3479 ∖ cdif 3961 ⊆ wss 3964 ∪ cuni 4913 ran crn 5691 “ cima 5693 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-12 2176 ax-ext 2707 ax-sep 5303 ax-nul 5313 ax-pr 5439 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1541 df-fal 1551 df-ex 1778 df-sb 2064 df-clab 2714 df-cleq 2728 df-clel 2815 df-ral 3061 df-rex 3070 df-rab 3435 df-v 3481 df-dif 3967 df-un 3969 df-in 3971 df-ss 3981 df-nul 4341 df-if 4533 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4914 df-br 5150 df-opab 5212 df-xp 5696 df-cnv 5698 df-dm 5700 df-rn 5701 df-res 5702 df-ima 5703 |
This theorem is referenced by: sbthlem4 9131 sbthlem5 9132 |
Copyright terms: Public domain | W3C validator |