| 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 7018 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵))) | |
| 2 | dfss2 3921 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴) | |
| 3 | 2 | biimpi 216 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐵) = 𝐴) |
| 4 | 3 | imaeq2d 6027 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ 𝐴)) |
| 5 | 1, 4 | sylan9req 2793 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴)) |
| 6 | dfss2 3921 | . 2 ⊢ ((◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵) ↔ ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴)) | |
| 7 | 5, 6 | sylibr 234 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → (◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∩ cin 3902 ⊆ wss 3903 ◡ccnv 5631 “ cima 5635 Fun wfun 6494 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-fun 6502 |
| This theorem is referenced by: pwrssmgc 33092 gsumhashmul 33160 elrspunidl 33520 carsggect 34495 eulerpartlemmf 34552 eulerpartlemgf 34556 orvclteinc 34653 cnneiima 49270 |
| Copyright terms: Public domain | W3C validator |