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 7836 | . 2 ⊢ ({〈𝑋, 𝑌〉} supp 𝑍) ⊆ dom {〈𝑋, 𝑌〉} | |
2 | dmsnopss 6064 | . 2 ⊢ dom {〈𝑋, 𝑌〉} ⊆ {𝑋} | |
3 | 1, 2 | sstri 3969 | 1 ⊢ ({〈𝑋, 𝑌〉} supp 𝑍) ⊆ {𝑋} |
Colors of variables: wff setvar class |
Syntax hints: ⊆ wss 3929 {csn 4560 〈cop 4566 dom cdm 5548 (class class class)co 7149 supp csupp 7823 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-ral 3142 df-rex 3143 df-rab 3146 df-v 3493 df-sbc 3769 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-nul 4285 df-if 4461 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5060 df-opab 5122 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fv 6356 df-ov 7152 df-oprab 7153 df-mpo 7154 df-supp 7824 |
This theorem is referenced by: snopfsupp 8849 |
Copyright terms: Public domain | W3C validator |