| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpoxopn0yelv | Structured version Visualization version GIF version | ||
| Description: If there is an element of the value 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, then the second argument is an element of the first component of the first argument. (Contributed by Alexander van der Vekens, 10-Oct-2017.) |
| Ref | Expression |
|---|---|
| mpoxopn0yelv.f | ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶) |
| Ref | Expression |
|---|---|
| mpoxopn0yelv | ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 𝐾 ∈ 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpoxopn0yelv.f | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶) | |
| 2 | 1 | dmmpossx 8008 | . . . 4 ⊢ dom 𝐹 ⊆ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) |
| 3 | elfvdm 6861 | . . . . 5 ⊢ (𝑁 ∈ (𝐹‘〈〈𝑉, 𝑊〉, 𝐾〉) → 〈〈𝑉, 𝑊〉, 𝐾〉 ∈ dom 𝐹) | |
| 4 | df-ov 7359 | . . . . 5 ⊢ (〈𝑉, 𝑊〉𝐹𝐾) = (𝐹‘〈〈𝑉, 𝑊〉, 𝐾〉) | |
| 5 | 3, 4 | eleq2s 2857 | . . . 4 ⊢ (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 〈〈𝑉, 𝑊〉, 𝐾〉 ∈ dom 𝐹) |
| 6 | 2, 5 | sselid 3913 | . . 3 ⊢ (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 〈〈𝑉, 𝑊〉, 𝐾〉 ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥))) |
| 7 | fveq2 6827 | . . . . 5 ⊢ (𝑥 = 〈𝑉, 𝑊〉 → (1st ‘𝑥) = (1st ‘〈𝑉, 𝑊〉)) | |
| 8 | 7 | opeliunxp2 5780 | . . . 4 ⊢ (〈〈𝑉, 𝑊〉, 𝐾〉 ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) ↔ (〈𝑉, 𝑊〉 ∈ V ∧ 𝐾 ∈ (1st ‘〈𝑉, 𝑊〉))) |
| 9 | 8 | simprbi 498 | . . 3 ⊢ (〈〈𝑉, 𝑊〉, 𝐾〉 ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) → 𝐾 ∈ (1st ‘〈𝑉, 𝑊〉)) |
| 10 | 6, 9 | syl 17 | . 2 ⊢ (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 𝐾 ∈ (1st ‘〈𝑉, 𝑊〉)) |
| 11 | op1stg 7943 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (1st ‘〈𝑉, 𝑊〉) = 𝑉) | |
| 12 | 11 | eleq2d 2825 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ (1st ‘〈𝑉, 𝑊〉) ↔ 𝐾 ∈ 𝑉)) |
| 13 | 10, 12 | imbitrid 245 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 𝐾 ∈ 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Vcvv 3431 {csn 4555 〈cop 4561 ∪ ciun 4921 × cxp 5616 dom cdm 5618 ‘cfv 6485 (class class class)co 7356 ∈ cmpo 7358 1st c1st 7929 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 |
| This theorem is referenced by: mpoxopynvov0g 8154 mpoxopovel 8160 |
| Copyright terms: Public domain | W3C validator |