Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sbthlem6 | Structured version Visualization version GIF version |
Description: Lemma for sbth 8880. (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 6049 | . . . 4 ⊢ ran ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = (ran (𝑓 ↾ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) | |
2 | sbthlem.3 | . . . . 5 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) | |
3 | 2 | rneqi 5846 | . . . 4 ⊢ ran 𝐻 = ran ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
4 | df-ima 5602 | . . . . 5 ⊢ (𝑓 “ ∪ 𝐷) = ran (𝑓 ↾ ∪ 𝐷) | |
5 | 4 | uneq1i 4093 | . . . 4 ⊢ ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) = (ran (𝑓 ↾ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
6 | 1, 3, 5 | 3eqtr4i 2776 | . . 3 ⊢ ran 𝐻 = ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
7 | sbthlem.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
8 | sbthlem.2 | . . . . . 6 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))} | |
9 | 7, 8 | sbthlem4 8873 | . . . . 5 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → (◡𝑔 “ (𝐴 ∖ ∪ 𝐷)) = (𝐵 ∖ (𝑓 “ ∪ 𝐷))) |
10 | df-ima 5602 | . . . . 5 ⊢ (◡𝑔 “ (𝐴 ∖ ∪ 𝐷)) = ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)) | |
11 | 9, 10 | eqtr3di 2793 | . . . 4 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → (𝐵 ∖ (𝑓 “ ∪ 𝐷)) = ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷))) |
12 | 11 | uneq2d 4097 | . . 3 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = ((𝑓 “ ∪ 𝐷) ∪ ran (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))) |
13 | 6, 12 | eqtr4id 2797 | . 2 ⊢ (((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔) → ran 𝐻 = ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) |
14 | imassrn 5980 | . . . 4 ⊢ (𝑓 “ ∪ 𝐷) ⊆ ran 𝑓 | |
15 | sstr2 3928 | . . . 4 ⊢ ((𝑓 “ ∪ 𝐷) ⊆ ran 𝑓 → (ran 𝑓 ⊆ 𝐵 → (𝑓 “ ∪ 𝐷) ⊆ 𝐵)) | |
16 | 14, 15 | ax-mp 5 | . . 3 ⊢ (ran 𝑓 ⊆ 𝐵 → (𝑓 “ ∪ 𝐷) ⊆ 𝐵) |
17 | undif 4415 | . . 3 ⊢ ((𝑓 “ ∪ 𝐷) ⊆ 𝐵 ↔ ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = 𝐵) | |
18 | 16, 17 | sylib 217 | . 2 ⊢ (ran 𝑓 ⊆ 𝐵 → ((𝑓 “ ∪ 𝐷) ∪ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = 𝐵) |
19 | 13, 18 | sylan9eqr 2800 | 1 ⊢ ((ran 𝑓 ⊆ 𝐵 ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → ran 𝐻 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 {cab 2715 Vcvv 3432 ∖ cdif 3884 ∪ cun 3885 ⊆ wss 3887 ∪ cuni 4839 ◡ccnv 5588 dom cdm 5589 ran crn 5590 ↾ cres 5591 “ cima 5592 Fun wfun 6427 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-fun 6435 |
This theorem is referenced by: sbthlem9 8878 |
Copyright terms: Public domain | W3C validator |