| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpoxneldm | Structured version Visualization version GIF version | ||
| Description: If the first argument of an operation given by a maps-to rule is not an element of the first component of the domain or the second argument is not an element of the second component of the domain depending on the first argument, then the value of the operation is the empty set. (Contributed by AV, 25-Oct-2020.) |
| Ref | Expression |
|---|---|
| mpoxeldm.f | ⊢ 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) |
| Ref | Expression |
|---|---|
| mpoxneldm | ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nel 3031 | . . . 4 ⊢ (𝑋 ∉ 𝐶 ↔ ¬ 𝑋 ∈ 𝐶) | |
| 2 | df-nel 3031 | . . . 4 ⊢ (𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷 ↔ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) | |
| 3 | 1, 2 | orbi12i 914 | . . 3 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) ↔ (¬ 𝑋 ∈ 𝐶 ∨ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
| 4 | ianor 983 | . . 3 ⊢ (¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) ↔ (¬ 𝑋 ∈ 𝐶 ∨ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) | |
| 5 | 3, 4 | bitr4i 278 | . 2 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) ↔ ¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
| 6 | neq0 4318 | . . . 4 ⊢ (¬ (𝑋𝐹𝑌) = ∅ ↔ ∃𝑛 𝑛 ∈ (𝑋𝐹𝑌)) | |
| 7 | mpoxeldm.f | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) | |
| 8 | 7 | mpoxeldm 8193 | . . . . 5 ⊢ (𝑛 ∈ (𝑋𝐹𝑌) → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
| 9 | 8 | exlimiv 1930 | . . . 4 ⊢ (∃𝑛 𝑛 ∈ (𝑋𝐹𝑌) → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
| 10 | 6, 9 | sylbi 217 | . . 3 ⊢ (¬ (𝑋𝐹𝑌) = ∅ → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
| 11 | 10 | con1i 147 | . 2 ⊢ (¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅) |
| 12 | 5, 11 | sylbi 217 | 1 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ∉ wnel 3030 ⦋csb 3865 ∅c0 4299 (class class class)co 7390 ∈ cmpo 7392 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-nel 3031 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 |
| This theorem is referenced by: nbgrnvtx0 29273 clnbgrnvtx0 47832 |
| Copyright terms: Public domain | W3C validator |