Theorem ressnop0 6778

Description: If 𝐴 is not in 𝐶, then the restriction of a singleton of ⟨𝐴, 𝐵⟩ to 𝐶 is null. (Contributed by Scott Fenton, 15-Apr-2011.)

Assertion

Ref	Expression
ressnop0	⊢ (¬ 𝐴 ∈ 𝐶 → ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅)

Proof of Theorem ressnop0

Step	Hyp	Ref	Expression
1		opelxp1 5484	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝐶 × V) → 𝐴 ∈ 𝐶)
2	1	con3i 157	. 2 ⊢ (¬ 𝐴 ∈ 𝐶 → ¬ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × V))
3		df-res 5455	. . . 4 ⊢ ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ({⟨𝐴, 𝐵⟩} ∩ (𝐶 × V))
4		incom 4099	. . . 4 ⊢ ({⟨𝐴, 𝐵⟩} ∩ (𝐶 × V)) = ((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩})
5	3, 4	eqtri 2819	. . 3 ⊢ ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩})
6		disjsn 4554	. . . 4 ⊢ (((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩}) = ∅ ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × V))
7	6	biimpri 229	. . 3 ⊢ (¬ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × V) → ((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩}) = ∅)
8	5, 7	syl5eq 2843	. 2 ⊢ (¬ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × V) → ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅)
9	2, 8	syl 17	1 ⊢ (¬ 𝐴 ∈ 𝐶 → ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1522   ∈ wcel 2081  Vcvv 3437   ∩ cin 3858  ∅c0 4211  {csn 4472  ⟨cop 4478   × cxp 5441   ↾ cres 5445

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-ext 2769  ax-sep 5094  ax-nul 5101  ax-pr 5221

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ral 3110  df-rex 3111  df-rab 3114  df-v 3439  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-nul 4212  df-if 4382  df-sn 4473  df-pr 4475  df-op 4479  df-opab 5025  df-xp 5449  df-res 5455

This theorem is referenced by:  fvunsn  6804  fsnunres  6817  wfrlem14  7820  ex-res  27912  frrlem12  32743