![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dmsnopss | Structured version Visualization version GIF version |
Description: The domain of a singleton of an ordered pair is a subset of the singleton of the first member (with no sethood assumptions on 𝐵). (Contributed by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
dmsnopss | ⊢ dom {〈𝐴, 𝐵〉} ⊆ {𝐴} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dmsnopg 5642 | . . 3 ⊢ (𝐵 ∈ V → dom {〈𝐴, 𝐵〉} = {𝐴}) | |
2 | eqimss 3690 | . . 3 ⊢ (dom {〈𝐴, 𝐵〉} = {𝐴} → dom {〈𝐴, 𝐵〉} ⊆ {𝐴}) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝐵 ∈ V → dom {〈𝐴, 𝐵〉} ⊆ {𝐴}) |
4 | opprc2 4458 | . . . . . 6 ⊢ (¬ 𝐵 ∈ V → 〈𝐴, 𝐵〉 = ∅) | |
5 | 4 | sneqd 4222 | . . . . 5 ⊢ (¬ 𝐵 ∈ V → {〈𝐴, 𝐵〉} = {∅}) |
6 | 5 | dmeqd 5358 | . . . 4 ⊢ (¬ 𝐵 ∈ V → dom {〈𝐴, 𝐵〉} = dom {∅}) |
7 | dmsn0 5637 | . . . 4 ⊢ dom {∅} = ∅ | |
8 | 6, 7 | syl6eq 2701 | . . 3 ⊢ (¬ 𝐵 ∈ V → dom {〈𝐴, 𝐵〉} = ∅) |
9 | 0ss 4005 | . . 3 ⊢ ∅ ⊆ {𝐴} | |
10 | 8, 9 | syl6eqss 3688 | . 2 ⊢ (¬ 𝐵 ∈ V → dom {〈𝐴, 𝐵〉} ⊆ {𝐴}) |
11 | 3, 10 | pm2.61i 176 | 1 ⊢ dom {〈𝐴, 𝐵〉} ⊆ {𝐴} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1523 ∈ wcel 2030 Vcvv 3231 ⊆ wss 3607 ∅c0 3948 {csn 4210 〈cop 4216 dom cdm 5143 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pr 4936 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-rab 2950 df-v 3233 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-sn 4211 df-pr 4213 df-op 4217 df-br 4686 df-opab 4746 df-xp 5149 df-dm 5153 |
This theorem is referenced by: snopsuppss 7355 setsres 15948 setscom 15950 setsid 15961 strlemor1OLD 16016 strle1 16020 ex-res 27428 mapfzcons1 37597 |
Copyright terms: Public domain | W3C validator |