Theorem rab0 3386

Description: Any restricted class abstraction restricted to the empty set is empty. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
rab0	⊢ {𝑥 ∈ ∅ ∣ 𝜑} = ∅

Proof of Theorem rab0

Step	Hyp	Ref	Expression
1		noel 3362	. . . . 5 ⊢ ¬ 𝑥 ∈ ∅
2	1	intnanr 915	. . . 4 ⊢ ¬ (𝑥 ∈ ∅ ∧ 𝜑)
3		equid 1677	. . . . 5 ⊢ 𝑥 = 𝑥
4	3	notnoti 634	. . . 4 ⊢ ¬ ¬ 𝑥 = 𝑥
5	2, 4	2false 690	. . 3 ⊢ ((𝑥 ∈ ∅ ∧ 𝜑) ↔ ¬ 𝑥 = 𝑥)
6	5	abbii 2253	. 2 ⊢ {𝑥 ∣ (𝑥 ∈ ∅ ∧ 𝜑)} = {𝑥 ∣ ¬ 𝑥 = 𝑥}
7		df-rab 2423	. 2 ⊢ {𝑥 ∈ ∅ ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ ∅ ∧ 𝜑)}
8		dfnul2 3360	. 2 ⊢ ∅ = {𝑥 ∣ ¬ 𝑥 = 𝑥}
9	6, 7, 8	3eqtr4i 2168	1 ⊢ {𝑥 ∈ ∅ ∣ 𝜑} = ∅

Syntax hints:  ¬ wn 3   ∧ wa 103   = wceq 1331   ∈ wcel 1480  {cab 2123  {crab 2418  ∅c0 3358

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rab 2423  df-v 2683  df-dif 3068  df-nul 3359

This theorem is referenced by:  ssfirab  6815  sup00  6883