![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > funss | Structured version Visualization version GIF version |
Description: Subclass theorem for function predicate. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Mario Carneiro, 24-Jun-2014.) |
Ref | Expression |
---|---|
funss | ⊢ (𝐴 ⊆ 𝐵 → (Fun 𝐵 → Fun 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relss 5794 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (Rel 𝐵 → Rel 𝐴)) | |
2 | coss1 5869 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∘ ◡𝐴) ⊆ (𝐵 ∘ ◡𝐴)) | |
3 | cnvss 5886 | . . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵) | |
4 | coss2 5870 | . . . . . 6 ⊢ (◡𝐴 ⊆ ◡𝐵 → (𝐵 ∘ ◡𝐴) ⊆ (𝐵 ∘ ◡𝐵)) | |
5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ∘ ◡𝐴) ⊆ (𝐵 ∘ ◡𝐵)) |
6 | 2, 5 | sstrd 4006 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∘ ◡𝐴) ⊆ (𝐵 ∘ ◡𝐵)) |
7 | sstr2 4002 | . . . 4 ⊢ ((𝐴 ∘ ◡𝐴) ⊆ (𝐵 ∘ ◡𝐵) → ((𝐵 ∘ ◡𝐵) ⊆ I → (𝐴 ∘ ◡𝐴) ⊆ I )) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝐵 ∘ ◡𝐵) ⊆ I → (𝐴 ∘ ◡𝐴) ⊆ I )) |
9 | 1, 8 | anim12d 609 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((Rel 𝐵 ∧ (𝐵 ∘ ◡𝐵) ⊆ I ) → (Rel 𝐴 ∧ (𝐴 ∘ ◡𝐴) ⊆ I ))) |
10 | df-fun 6565 | . 2 ⊢ (Fun 𝐵 ↔ (Rel 𝐵 ∧ (𝐵 ∘ ◡𝐵) ⊆ I )) | |
11 | df-fun 6565 | . 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ (𝐴 ∘ ◡𝐴) ⊆ I )) | |
12 | 9, 10, 11 | 3imtr4g 296 | 1 ⊢ (𝐴 ⊆ 𝐵 → (Fun 𝐵 → Fun 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ⊆ wss 3963 I cid 5582 ◡ccnv 5688 ∘ ccom 5693 Rel wrel 5694 Fun wfun 6557 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ss 3980 df-br 5149 df-opab 5211 df-rel 5696 df-cnv 5697 df-co 5698 df-fun 6565 |
This theorem is referenced by: funeq 6588 funopab4 6605 funres 6610 fun0 6633 funcnvcnv 6635 funin 6644 funres11 6645 foimacnv 6866 funelss 8071 funsssuppss 8214 fsuppss 9421 strle1 17192 strssd 17240 pjpm 21746 subgrfun 29313 setrecsss 48932 |
Copyright terms: Public domain | W3C validator |