Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  mpo0 Structured version   Visualization version   GIF version

Theorem mpo0 7222
 Description: A mapping operation with empty domain. In this version of mpo0v 7221, 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.
StepHypRef Expression
1 df-mpo 7144 . 2 (𝑥 ∈ ∅, 𝑦𝐵𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶)}
2 df-oprab 7143 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶)} = {𝑤 ∣ ∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶))}
3 noel 4250 . . . . . . 7 ¬ 𝑥 ∈ ∅
4 simprll 778 . . . . . . 7 ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶)) → 𝑥 ∈ ∅)
53, 4mto 200 . . . . . 6 ¬ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶))
65nex 1802 . . . . 5 ¬ ∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶))
76nex 1802 . . . 4 ¬ ∃𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶))
87nex 1802 . . 3 ¬ ∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶))
98abf 4313 . 2 {𝑤 ∣ ∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ ((𝑥 ∈ ∅ ∧ 𝑦𝐵) ∧ 𝑧 = 𝐶))} = ∅
101, 2, 93eqtri 2828 1 (𝑥 ∈ ∅, 𝑦𝐵𝐶) = ∅
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 399   = wceq 1538  ∃wex 1781   ∈ wcel 2112  {cab 2779  ∅c0 4246  ⟨cop 4534  {coprab 7140   ∈ cmpo 7141 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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-ext 2773 This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-dif 3887  df-nul 4247  df-oprab 7143  df-mpo 7144 This theorem is referenced by:  coafval  17320  d0mat2pmat  21347
 Copyright terms: Public domain W3C validator