| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relfull | Structured version Visualization version GIF version | ||
| Description: The set of full functors is a relation. (Contributed by Mario Carneiro, 26-Jan-2017.) |
| Ref | Expression |
|---|---|
| relfull | ⊢ Rel (𝐶 Full 𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fullfunc 17926 | . 2 ⊢ (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷) | |
| 2 | relfunc 17880 | . 2 ⊢ Rel (𝐶 Func 𝐷) | |
| 3 | relss 5765 | . 2 ⊢ ((𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷) → (Rel (𝐶 Func 𝐷) → Rel (𝐶 Full 𝐷))) | |
| 4 | 1, 2, 3 | mp2 9 | 1 ⊢ Rel (𝐶 Full 𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3931 Rel wrel 5664 (class class class)co 7410 Func cfunc 17872 Full cful 17922 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7993 df-2nd 7994 df-func 17876 df-full 17924 |
| This theorem is referenced by: fullpropd 17940 cofull 17954 imasubc 49058 idfullsubc 49067 thincciso 49306 thincciso2 49308 |
| Copyright terms: Public domain | W3C validator |