![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sbthlem6 | Structured version Visualization version GIF version |
Description: Lemma for sbth 8621. (Contributed by NM, 27-Mar-1998.) |
Ref | Expression |
---|---|
sbthlem.1 | ⊢ 𝐴 ∈ V |
sbthlem.2 | ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} |
sbthlem.3 | ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
Ref | Expression |
---|---|
sbthlem6 | ⊢ ((ran 𝑓 ⊆ 𝐵 ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → ran 𝐻 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rnun 5971 | . . . 4 ⊢ ran ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = (ran (𝑓 ↾ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) | |
2 | sbthlem.3 | . . . . 5 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) | |
3 | 2 | rneqi 5771 | . . . 4 ⊢ ran 𝐻 = ran ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
4 | df-ima 5532 | . . . . 5 ⊢ (𝑓 “ ∪ 𝐷) = ran (𝑓 ↾ ∪ 𝐷) | |
5 | 4 | uneq1i 4086 | . . . 4 ⊢ ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = (ran (𝑓 ↾ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
6 | 1, 3, 5 | 3eqtr4i 2831 | . . 3 ⊢ ran 𝐻 = ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
7 | df-ima 5532 | . . . . 5 ⊢ (◡𝑔 “ (𝐴 ∖ ∪ 𝐷)) = ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) | |
8 | sbthlem.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
9 | sbthlem.2 | . . . . . 6 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} | |
10 | 8, 9 | sbthlem4 8614 | . . . . 5 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → (◡𝑔 “ (𝐴 ∖ ∪ 𝐷)) = (𝐵 ∖ (𝑓 “ ∪ 𝐷))) |
11 | 7, 10 | syl5reqr 2848 | . . . 4 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → (𝐵 ∖ (𝑓 “ ∪ 𝐷)) = ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
12 | 11 | uneq2d 4090 | . . 3 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))) |
13 | 6, 12 | eqtr4id 2852 | . 2 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → ran 𝐻 = ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) |
14 | imassrn 5907 | . . . 4 ⊢ (𝑓 “ ∪ 𝐷) ⊆ ran 𝑓 | |
15 | sstr2 3922 | . . . 4 ⊢ ((𝑓 “ ∪ 𝐷) ⊆ ran 𝑓 → (ran 𝑓 ⊆ 𝐵 → (𝑓 “ ∪ 𝐷) ⊆ 𝐵)) | |
16 | 14, 15 | ax-mp 5 | . . 3 ⊢ (ran 𝑓 ⊆ 𝐵 → (𝑓 “ ∪ 𝐷) ⊆ 𝐵) |
17 | undif 4388 | . . 3 ⊢ ((𝑓 “ ∪ 𝐷) ⊆ 𝐵 ↔ ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = 𝐵) | |
18 | 16, 17 | sylib 221 | . 2 ⊢ (ran 𝑓 ⊆ 𝐵 → ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = 𝐵) |
19 | 13, 18 | sylan9eqr 2855 | 1 ⊢ ((ran 𝑓 ⊆ 𝐵 ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → ran 𝐻 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 {cab 2776 Vcvv 3441 ∖ cdif 3878 ∪ cun 3879 ⊆ wss 3881 ∪ cuni 4800 ◡ccnv 5518 dom cdm 5519 ran crn 5520 ↾ cres 5521 “ cima 5522 Fun wfun 6318 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-fun 6326 |
This theorem is referenced by: sbthlem9 8619 |
Copyright terms: Public domain | W3C validator |