| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpoxopn0yelv | 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 6439 | . . . 4 ⊢ dom 𝐹 ⊆ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) |
| 3 | 1 | mpofun 6193 | . . . . . . 7 ⊢ Fun 𝐹 |
| 4 | funrel 5397 | . . . . . . 7 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 5 | 3, 4 | ax-mp 5 | . . . . . 6 ⊢ Rel 𝐹 |
| 6 | relelfvdm 5730 | . . . . . 6 ⊢ ((Rel 𝐹 ∧ 𝑁 ∈ (𝐹‘〈〈𝑉, 𝑊〉, 𝐾〉)) → 〈〈𝑉, 𝑊〉, 𝐾〉 ∈ dom 𝐹) | |
| 7 | 5, 6 | mpan 428 | . . . . 5 ⊢ (𝑁 ∈ (𝐹‘〈〈𝑉, 𝑊〉, 𝐾〉) → 〈〈𝑉, 𝑊〉, 𝐾〉 ∈ dom 𝐹) |
| 8 | df-ov 6091 | . . . . 5 ⊢ (〈𝑉, 𝑊〉𝐹𝐾) = (𝐹‘〈〈𝑉, 𝑊〉, 𝐾〉) | |
| 9 | 7, 8 | eleq2s 2333 | . . . 4 ⊢ (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 〈〈𝑉, 𝑊〉, 𝐾〉 ∈ dom 𝐹) |
| 10 | 2, 9 | sselid 3246 | . . 3 ⊢ (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 〈〈𝑉, 𝑊〉, 𝐾〉 ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥))) |
| 11 | fveq2 5698 | . . . . 5 ⊢ (𝑥 = 〈𝑉, 𝑊〉 → (1st ‘𝑥) = (1st ‘〈𝑉, 𝑊〉)) | |
| 12 | 11 | opeliunxp2 4922 | . . . 4 ⊢ (〈〈𝑉, 𝑊〉, 𝐾〉 ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) ↔ (〈𝑉, 𝑊〉 ∈ V ∧ 𝐾 ∈ (1st ‘〈𝑉, 𝑊〉))) |
| 13 | 12 | simprbi 275 | . . 3 ⊢ (〈〈𝑉, 𝑊〉, 𝐾〉 ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) → 𝐾 ∈ (1st ‘〈𝑉, 𝑊〉)) |
| 14 | 10, 13 | syl 14 | . 2 ⊢ (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 𝐾 ∈ (1st ‘〈𝑉, 𝑊〉)) |
| 15 | op1stg 6388 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (1st ‘〈𝑉, 𝑊〉) = 𝑉) | |
| 16 | 15 | eleq2d 2308 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ (1st ‘〈𝑉, 𝑊〉) ↔ 𝐾 ∈ 𝑉)) |
| 17 | 14, 16 | imbitrid 154 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (〈𝑉, 𝑊〉𝐹𝐾) → 𝐾 ∈ 𝑉)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 Vcvv 2821 {csn 3709 〈cop 3712 ∪ ciun 4012 × cxp 4774 dom cdm 4776 Rel wrel 4781 Fun wfun 5374 ‘cfv 5380 (class class class)co 6088 ∈ cmpo 6090 1st c1st 6376 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fv 5388 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 |
| This theorem is used by: mpoxopovel 6516 |
| Copyright terms: Public domain | W3C validator |