![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mpoxopx0ov0 | Structured version Visualization version GIF version |
Description: If the first argument of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument, is the empty set, then the value of the operation is the empty set. (Contributed by Alexander van der Vekens, 10-Oct-2017.) |
Ref | Expression |
---|---|
mpoxopn0yelv.f | ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶) |
Ref | Expression |
---|---|
mpoxopx0ov0 | ⊢ (∅𝐹𝐾) = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0nelxp 5701 | . 2 ⊢ ¬ ∅ ∈ (V × V) | |
2 | mpoxopn0yelv.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶) | |
3 | 2 | mpoxopxnop0 8196 | . 2 ⊢ (¬ ∅ ∈ (V × V) → (∅𝐹𝐾) = ∅) |
4 | 1, 3 | ax-mp 5 | 1 ⊢ (∅𝐹𝐾) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1533 ∈ wcel 2098 Vcvv 3466 ∅c0 4315 × cxp 5665 ‘cfv 6534 (class class class)co 7402 ∈ cmpo 7404 1st c1st 7967 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5290 ax-nul 5297 ax-pr 5418 ax-un 7719 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fv 6542 df-ov 7405 df-oprab 7406 df-mpo 7407 df-1st 7969 df-2nd 7970 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |