| 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 5673 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × V) → 𝐴 ∈ 𝐶) | |
| 2 | df-res 5643 | . . . 4 ⊢ ({〈𝐴, 𝐵〉} ↾ 𝐶) = ({〈𝐴, 𝐵〉} ∩ (𝐶 × V)) | |
| 3 | incom 4149 | . . . 4 ⊢ ({〈𝐴, 𝐵〉} ∩ (𝐶 × V)) = ((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) | |
| 4 | 2, 3 | eqtri 2759 | . . 3 ⊢ ({〈𝐴, 𝐵〉} ↾ 𝐶) = ((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) |
| 5 | disjsn 4655 | . . . 4 ⊢ (((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) = ∅ ↔ ¬ 〈𝐴, 𝐵〉 ∈ (𝐶 × V)) | |
| 6 | 5 | biimpri 228 | . . 3 ⊢ (¬ 〈𝐴, 𝐵〉 ∈ (𝐶 × V) → ((𝐶 × V) ∩ {〈𝐴, 𝐵〉}) = ∅) |
| 7 | 4, 6 | eqtrid 2783 | . 2 ⊢ (¬ 〈𝐴, 𝐵〉 ∈ (𝐶 × V) → ({〈𝐴, 𝐵〉} ↾ 𝐶) = ∅) |
| 8 | 1, 7 | nsyl5 159 | 1 ⊢ (¬ 𝐴 ∈ 𝐶 → ({〈𝐴, 𝐵〉} ↾ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3429 ∩ cin 3888 ∅c0 4273 {csn 4567 〈cop 4573 × cxp 5629 ↾ cres 5633 |
| 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-ext 2708 ax-sep 5231 ax-pr 5375 |
| 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-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-opab 5148 df-xp 5637 df-res 5643 |
| This theorem is referenced by: fvunsn 7134 fsnunres 7143 frrlem12 8247 ex-res 30511 |
| Copyright terms: Public domain | W3C validator |