| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpoxopoveqd | Structured version Visualization version GIF version | ||
| Description: 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, deduction version. (Contributed by Alexander van der Vekens, 11-Oct-2017.) |
| Ref | Expression |
|---|---|
| mpoxopoveq.f | ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ {𝑛 ∈ (1st ‘𝑥) ∣ 𝜑}) |
| mpoxopoveqd.1 | ⊢ (𝜓 → (𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌)) |
| mpoxopoveqd.2 | ⊢ ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑} = ∅) |
| Ref | Expression |
|---|---|
| mpoxopoveqd | ⊢ (𝜓 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpoxopoveq.f | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ {𝑛 ∈ (1st ‘𝑥) ∣ 𝜑}) | |
| 2 | 1 | mpoxopoveq 8200 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 3 | 2 | ex 412 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ 𝑉 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑})) |
| 4 | mpoxopoveqd.1 | . . 3 ⊢ (𝜓 → (𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌)) | |
| 5 | 3, 4 | syl11 33 | . 2 ⊢ (𝐾 ∈ 𝑉 → (𝜓 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑})) |
| 6 | df-nel 3031 | . . . . . 6 ⊢ (𝐾 ∉ 𝑉 ↔ ¬ 𝐾 ∈ 𝑉) | |
| 7 | 1 | mpoxopynvov0 8199 | . . . . . 6 ⊢ (𝐾 ∉ 𝑉 → (〈𝑉, 𝑊〉𝐹𝐾) = ∅) |
| 8 | 6, 7 | sylbir 235 | . . . . 5 ⊢ (¬ 𝐾 ∈ 𝑉 → (〈𝑉, 𝑊〉𝐹𝐾) = ∅) |
| 9 | 8 | adantr 480 | . . . 4 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → (〈𝑉, 𝑊〉𝐹𝐾) = ∅) |
| 10 | mpoxopoveqd.2 | . . . . . 6 ⊢ ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑} = ∅) | |
| 11 | 10 | eqcomd 2736 | . . . . 5 ⊢ ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → ∅ = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 12 | 11 | ancoms 458 | . . . 4 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → ∅ = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 13 | 9, 12 | eqtrd 2765 | . . 3 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 14 | 13 | ex 412 | . 2 ⊢ (¬ 𝐾 ∈ 𝑉 → (𝜓 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑})) |
| 15 | 5, 14 | pm2.61i 182 | 1 ⊢ (𝜓 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∉ wnel 3030 {crab 3408 Vcvv 3450 [wsbc 3755 ∅c0 4298 〈cop 4597 ‘cfv 6513 (class class class)co 7389 ∈ cmpo 7391 1st c1st 7968 |
| 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 5253 ax-nul 5263 ax-pr 5389 ax-un 7713 |
| 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-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6515 df-fv 6521 df-ov 7392 df-oprab 7393 df-mpo 7394 df-1st 7970 df-2nd 7971 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |