| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sspreima | Structured version Visualization version GIF version | ||
| Description: The preimage of a subset is a subset of the preimage. (Contributed by Brendan Leahy, 23-Sep-2017.) |
| Ref | Expression |
|---|---|
| sspreima | ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → (◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inpreima 7041 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵))) | |
| 2 | dfss2 3922 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴) | |
| 3 | 2 | biimpi 218 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐵) = 𝐴) |
| 4 | 3 | imaeq2d 6046 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ 𝐴)) |
| 5 | 1, 4 | sylan9req 2817 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴)) |
| 6 | dfss2 3922 | . 2 ⊢ ((◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵) ↔ ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴)) | |
| 7 | 5, 6 | sylibr 236 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → (◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∩ cin 3903 ⊆ wss 3904 ◡ccnv 5644 “ cima 5648 Fun wfun 6511 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-br 5100 df-opab 5162 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-fun 6519 |
| This theorem is referenced by: pwrssmgc 33139 gsumhashmul 33208 elrspunidl 33575 carsggect 34576 eulerpartlemmf 34633 eulerpartlemgf 34637 orvclteinc 34734 cnneiima 49502 |
| Copyright terms: Public domain | W3C validator |