| 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 17877 | . 2 ⊢ (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷) | |
| 2 | relfunc 17831 | . 2 ⊢ Rel (𝐶 Func 𝐷) | |
| 3 | relss 5747 | . 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 3917 Rel wrel 5646 (class class class)co 7390 Func cfunc 17823 Full cful 17873 |
| 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 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 ax-un 7714 |
| 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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 df-func 17827 df-full 17875 |
| This theorem is referenced by: fullpropd 17891 cofull 17905 imasubc 49144 idfullsubc 49154 fulloppf 49156 uptrlem2 49204 uptra 49208 uptrar 49209 uptr2a 49215 thincciso 49446 thincciso2 49448 |
| Copyright terms: Public domain | W3C validator |