![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > funimass1 | GIF version |
Description: A kind of contraposition law that infers a subclass of an image from a preimage subclass. (Contributed by NM, 25-May-2004.) |
Ref | Expression |
---|---|
funimass1 | ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((◡𝐹 “ 𝐴) ⊆ 𝐵 → 𝐴 ⊆ (𝐹 “ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | imass2 4955 | . 2 ⊢ ((◡𝐹 “ 𝐴) ⊆ 𝐵 → (𝐹 “ (◡𝐹 “ 𝐴)) ⊆ (𝐹 “ 𝐵)) | |
2 | funimacnv 5239 | . . . 4 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐴)) = (𝐴 ∩ ran 𝐹)) | |
3 | dfss 3112 | . . . . . 6 ⊢ (𝐴 ⊆ ran 𝐹 ↔ 𝐴 = (𝐴 ∩ ran 𝐹)) | |
4 | 3 | biimpi 119 | . . . . 5 ⊢ (𝐴 ⊆ ran 𝐹 → 𝐴 = (𝐴 ∩ ran 𝐹)) |
5 | 4 | eqcomd 2160 | . . . 4 ⊢ (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴) |
6 | 2, 5 | sylan9eq 2207 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐹 “ (◡𝐹 “ 𝐴)) = 𝐴) |
7 | 6 | sseq1d 3153 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐹 “ (◡𝐹 “ 𝐴)) ⊆ (𝐹 “ 𝐵) ↔ 𝐴 ⊆ (𝐹 “ 𝐵))) |
8 | 1, 7 | syl5ib 153 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((◡𝐹 “ 𝐴) ⊆ 𝐵 → 𝐴 ⊆ (𝐹 “ 𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 ∩ cin 3097 ⊆ wss 3098 ◡ccnv 4578 ran crn 4580 “ cima 4582 Fun wfun 5157 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1481 ax-10 1482 ax-11 1483 ax-i12 1484 ax-bndl 1486 ax-4 1487 ax-17 1503 ax-i9 1507 ax-ial 1511 ax-i5r 1512 ax-14 2128 ax-ext 2136 ax-sep 4078 ax-pow 4130 ax-pr 4164 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1740 df-eu 2006 df-mo 2007 df-clab 2141 df-cleq 2147 df-clel 2150 df-nfc 2285 df-ral 2437 df-rex 2438 df-v 2711 df-un 3102 df-in 3104 df-ss 3111 df-pw 3541 df-sn 3562 df-pr 3563 df-op 3565 df-br 3962 df-opab 4022 df-id 4248 df-xp 4585 df-rel 4586 df-cnv 4587 df-co 4588 df-dm 4589 df-rn 4590 df-res 4591 df-ima 4592 df-fun 5165 |
This theorem is referenced by: hmeontr 12652 |
Copyright terms: Public domain | W3C validator |