Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mpt20 | GIF version |
Description: A mapping operation with empty domain. (Contributed by Stefan O'Rear, 29-Jan-2015.) (Revised by Mario Carneiro, 15-May-2015.) |
Ref | Expression |
---|---|
mpt20 | ⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mpt2 5537 | . 2 ⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} | |
2 | df-oprab 5536 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))} | |
3 | noel 3255 | . . . . . . 7 ⊢ ¬ 𝑥 ∈ ∅ | |
4 | simprll 503 | . . . . . . 7 ⊢ ((𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)) → 𝑥 ∈ ∅) | |
5 | 3, 4 | mto 620 | . . . . . 6 ⊢ ¬ (𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)) |
6 | 5 | nex 1429 | . . . . 5 ⊢ ¬ ∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)) |
7 | 6 | nex 1429 | . . . 4 ⊢ ¬ ∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)) |
8 | 7 | nex 1429 | . . 3 ⊢ ¬ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)) |
9 | 8 | abf 3287 | . 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶))} = ∅ |
10 | 1, 2, 9 | 3eqtri 2105 | 1 ⊢ (𝑥 ∈ ∅, 𝑦 ∈ 𝐵 ↦ 𝐶) = ∅ |
Colors of variables: wff set class |
Syntax hints: ∧ wa 102 = wceq 1284 ∃wex 1421 ∈ wcel 1433 {cab 2067 ∅c0 3251 〈cop 3401 {coprab 5533 ↦ cmpt2 5534 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-v 2603 df-dif 2975 df-in 2979 df-ss 2986 df-nul 3252 df-oprab 5536 df-mpt2 5537 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |