Theorem ressnop0 7095

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 5663	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝐶 × V) → 𝐴 ∈ 𝐶)
2		df-res 5633	. . . 4 ⊢ ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ({⟨𝐴, 𝐵⟩} ∩ (𝐶 × V))
3		incom 4158	. . . 4 ⊢ ({⟨𝐴, 𝐵⟩} ∩ (𝐶 × V)) = ((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩})
4	2, 3	eqtri 2756	. . 3 ⊢ ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩})
5		disjsn 4665	. . . 4 ⊢ (((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩}) = ∅ ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × V))
6	5	biimpri 228	. . 3 ⊢ (¬ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × V) → ((𝐶 × V) ∩ {⟨𝐴, 𝐵⟩}) = ∅)
7	4, 6	eqtrid 2780	. 2 ⊢ (¬ ⟨𝐴, 𝐵⟩ ∈ (𝐶 × V) → ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅)
8	1, 7	nsyl5 159	1 ⊢ (¬ 𝐴 ∈ 𝐶 → ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1541   ∈ wcel 2113  Vcvv 3437   ∩ cin 3897  ∅c0 4282  {csn 4577  ⟨cop 4583   × cxp 5619   ↾ cres 5623

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-opab 5158  df-xp 5627  df-res 5633

This theorem is referenced by:  fvunsn  7122  fsnunres  7131  frrlem12  8236  ex-res  30442