| 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 17844 | . 2 ⊢ (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷) | |
| 2 | relfunc 17798 | . 2 ⊢ Rel (𝐶 Func 𝐷) | |
| 3 | relss 5739 | . 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 3903 Rel wrel 5637 (class class class)co 7368 Func cfunc 17790 Full cful 17840 |
| 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-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| 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-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 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-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 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-iota 6456 df-fun 6502 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-func 17794 df-full 17842 |
| This theorem is referenced by: fullpropd 17858 cofull 17872 imasubc 49504 idfullsubc 49514 fulloppf 49516 uptrlem2 49564 uptra 49568 uptrar 49569 uptr2a 49575 thincciso 49806 thincciso2 49808 |
| Copyright terms: Public domain | W3C validator |