Theorem mpo0 7360

Description: A mapping operation with empty domain. In this version of mpo0v 7359, the class of the second operator may depend on the first operator. (Contributed by Stefan O'Rear, 29-Jan-2015.) (Revised by Mario Carneiro, 15-May-2015.)

Assertion

Ref	Expression
mpo0	⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∅

Proof of Theorem mpo0

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-mpo 7280	. 2 ⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)}
2		df-oprab 7279	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))}
3		noel 4264	. . . . . . 7 ⊢ ¬ 𝑥 ∈ ∅
4		simprll 776	. . . . . . 7 ⊢ ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)) → 𝑥 ∈ ∅)
5	3, 4	mto 196	. . . . . 6 ⊢ ¬ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))
6	5	nex 1803	. . . . 5 ⊢ ¬ ∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))
7	6	nex 1803	. . . 4 ⊢ ¬ ∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))
8	7	nex 1803	. . 3 ⊢ ¬ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))
9	8	abf 4336	. 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))} = ∅
10	1, 2, 9	3eqtri 2770	1 ⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∅

Syntax hints:   ∧ wa 396   = wceq 1539  ∃wex 1782   ∈ wcel 2106  {cab 2715  ∅c0 4256  ⟨cop 4567  {coprab 7276   ∈ cmpo 7277

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-dif 3890  df-nul 4257  df-oprab 7279  df-mpo 7280

This theorem is referenced by:  coafval  17779  d0mat2pmat  21887