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 3050 | . . . 4 ⊢ (𝑋 ∉ 𝐶 ↔ ¬ 𝑋 ∈ 𝐶) | |
2 | df-nel 3050 | . . . 4 ⊢ (𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷 ↔ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) | |
3 | 1, 2 | orbi12i 912 | . . 3 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) ↔ (¬ 𝑋 ∈ 𝐶 ∨ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
4 | ianor 979 | . . 3 ⊢ (¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) ↔ (¬ 𝑋 ∈ 𝐶 ∨ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) | |
5 | 3, 4 | bitr4i 277 | . 2 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) ↔ ¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
6 | neq0 4279 | . . . 4 ⊢ (¬ (𝑋𝐹𝑌) = ∅ ↔ ∃𝑛 𝑛 ∈ (𝑋𝐹𝑌)) | |
7 | mpoxeldm.f | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) | |
8 | 7 | mpoxeldm 8027 | . . . . 5 ⊢ (𝑛 ∈ (𝑋𝐹𝑌) → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
9 | 8 | exlimiv 1933 | . . . 4 ⊢ (∃𝑛 𝑛 ∈ (𝑋𝐹𝑌) → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
10 | 6, 9 | sylbi 216 | . . 3 ⊢ (¬ (𝑋𝐹𝑌) = ∅ → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)) |
11 | 10 | con1i 147 | . 2 ⊢ (¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅) |
12 | 5, 11 | sylbi 216 | 1 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 844 = wceq 1539 ∃wex 1782 ∈ wcel 2106 ∉ wnel 3049 ⦋csb 3832 ∅c0 4256 (class class class)co 7275 ∈ cmpo 7277 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-nel 3050 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 |
This theorem is referenced by: nbgrnvtx0 27706 |
Copyright terms: Public domain | W3C validator |