| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpo0v | Structured version Visualization version GIF version | ||
| Description: A mapping operation with empty domain. (Contributed by Stefan O'Rear, 29-Jan-2015.) (Revised by Mario Carneiro, 15-May-2015.) (Proof shortened by AV, 27-Jan-2024.) |
| Ref | Expression |
|---|---|
| mpo0v | ⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . 3 ⊢ ∅ = ∅ | |
| 2 | 1 | orci 879 | . 2 ⊢ (∅ = ∅ ∨ 𝐵 = ∅) |
| 3 | 0mpo0 7502 | . 2 ⊢ ((∅ = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∅) | |
| 4 | 2, 3 | ax-mp 5 | 1 ⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∨ wo 861 = wceq 1570 ∅c0 4286 ∈ cmpo 7421 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-dif 3909 df-nul 4287 df-oprab 7423 df-mpo 7424 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |