| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ressnop0 | Structured version Visualization version GIF version | ||
| Description: If 𝐴 is not in 𝐶, then the restriction of a singleton of 〈𝐴, 𝐵〉 to 𝐶 is null. (Contributed by Scott Fenton, 15-Apr-2011.) |
| Ref | Expression |
|---|---|
| ressnop0 | ⊢ (¬ 𝐴 ∈ 𝐶 → ({〈𝐴, 𝐵〉} ↾ 𝐶) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opelxp1 5701 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × V) → 𝐴 ∈ 𝐶) | |
| 2 | df-res 5671 | . . . 4 ⊢ ({〈𝐴, 𝐵〉} ↾ 𝐶) = ({〈𝐴, 𝐵〉} ∩ (𝐶 × V)) | |
| 3 | incom 4170 | . . . 4 ⊢ ({〈𝐴, 𝐵〉} ∩ (𝐶 × V)) = ((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) | |
| 4 | 2, 3 | eqtri 2792 | . . 3 ⊢ ({〈𝐴, 𝐵〉} ↾ 𝐶) = ((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) |
| 5 | disjsn 4679 | . . . 4 ⊢ (((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) = ∅ ↔ ¬ 〈𝐴, 𝐵〉 ∈ (𝐶 × V)) | |
| 6 | 5 | biimpri 231 | . . 3 ⊢ (¬ 〈𝐴, 𝐵〉 ∈ (𝐶 × V) → ((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) = ∅) |
| 7 | 4, 6 | eqtrid 2816 | . 2 ⊢ (¬ 〈𝐴, 𝐵〉 ∈ (𝐶 × V) → ({〈𝐴, 𝐵〉} ↾ 𝐶) = ∅) |
| 8 | 1, 7 | nsyl5 160 | 1 ⊢ (¬ 𝐴 ∈ 𝐶 → ({〈𝐴, 𝐵〉} ↾ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ∩ cin 3912 ∅c0 4294 {csn 4591 〈cop 4597 × cxp 5657 ↾ cres 5661 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5258 ax-pr 5402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-opab 5175 df-xp 5665 df-res 5671 |
| This theorem is referenced by: fvunsn 7175 fsnunres 7184 frrlem12 8290 ex-res 30729 |
| Copyright terms: Public domain | W3C validator |