| 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 8239 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 3 | 2 | ex 418 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ 𝑉 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑})) |
| 4 | mpoxopoveqd.1 | . . 3 ⊢ (𝜓 → (𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌)) | |
| 5 | 3, 4 | syl11 34 | . 2 ⊢ (𝐾 ∈ 𝑉 → (𝜓 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑})) |
| 6 | df-nel 3062 | . . . . . 6 ⊢ (𝐾 ∉ 𝑉 ↔ ¬ 𝐾 ∈ 𝑉) | |
| 7 | 1 | mpoxopynvov0 8238 | . . . . . 6 ⊢ (𝐾 ∉ 𝑉 → (〈𝑉, 𝑊〉𝐹𝐾) = ∅) |
| 8 | 6, 7 | sylbir 238 | . . . . 5 ⊢ (¬ 𝐾 ∈ 𝑉 → (〈𝑉, 𝑊〉𝐹𝐾) = ∅) |
| 9 | 8 | adantr 486 | . . . 4 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → (〈𝑉, 𝑊〉𝐹𝐾) = ∅) |
| 10 | mpoxopoveqd.2 | . . . . . 6 ⊢ ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑} = ∅) | |
| 11 | 10 | eqcomd 2766 | . . . . 5 ⊢ ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → ∅ = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 12 | 11 | ancoms 464 | . . . 4 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → ∅ = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 13 | 9, 12 | eqtrd 2795 | . . 3 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| 14 | 13 | ex 418 | . 2 ⊢ (¬ 𝐾 ∈ 𝑉 → (𝜓 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑})) |
| 15 | 5, 14 | pm2.61i 184 | 1 ⊢ (𝜓 → (〈𝑉, 𝑊〉𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [〈𝑉, 𝑊〉 / 𝑥][𝐾 / 𝑦]𝜑}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∉ wnel 3061 {crab 3412 Vcvv 3450 [wsbc 3738 ∅c0 4278 〈cop 4834 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 1st c1st 7999 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |