Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > snopsuppss | Structured version Visualization version GIF version |
Description: The support of a singleton containing an ordered pair is a subset of the singleton containing the first element of the ordered pair, i.e. it is empty or the singleton itself. (Contributed by AV, 19-Jul-2019.) |
Ref | Expression |
---|---|
snopsuppss | ⊢ ({〈𝑋, 𝑌〉} supp 𝑍) ⊆ {𝑋} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | suppssdm 7845 | . 2 ⊢ ({〈𝑋, 𝑌〉} supp 𝑍) ⊆ dom {〈𝑋, 𝑌〉} | |
2 | dmsnopss 6073 | . 2 ⊢ dom {〈𝑋, 𝑌〉} ⊆ {𝑋} | |
3 | 1, 2 | sstri 3978 | 1 ⊢ ({〈𝑋, 𝑌〉} supp 𝑍) ⊆ {𝑋} |
Colors of variables: wff setvar class |
Syntax hints: ⊆ wss 3938 {csn 4569 〈cop 4575 dom cdm 5557 (class class class)co 7158 supp csupp 7832 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-supp 7833 |
This theorem is referenced by: snopfsupp 8858 |
Copyright terms: Public domain | W3C validator |