![]() |
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 8205 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}) |
3 | 2 | ex 412 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})) |
4 | mpoxopoveqd.1 | . . 3 ⊢ (𝜓 → (𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌)) | |
5 | 3, 4 | syl11 33 | . 2 ⊢ (𝐾 ∈ 𝑉 → (𝜓 → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})) |
6 | df-nel 3041 | . . . . . 6 ⊢ (𝐾 ∉ 𝑉 ↔ ¬ 𝐾 ∈ 𝑉) | |
7 | 1 | mpoxopynvov0 8204 | . . . . . 6 ⊢ (𝐾 ∉ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅) |
8 | 6, 7 | sylbir 234 | . . . . 5 ⊢ (¬ 𝐾 ∈ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅) |
9 | 8 | adantr 480 | . . . 4 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅) |
10 | mpoxopoveqd.2 | . . . . . 6 ⊢ ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} = ∅) | |
11 | 10 | eqcomd 2732 | . . . . 5 ⊢ ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → ∅ = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}) |
12 | 11 | ancoms 458 | . . . 4 ⊢ ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → ∅ = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}) |
13 | 9, 12 | eqtrd 2766 | . . 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 1533 ∈ wcel 2098 ∉ wnel 3040 {crab 3426 Vcvv 3468 [wsbc 3772 ∅c0 4317 ⟨cop 4629 ‘cfv 6537 (class class class)co 7405 ∈ cmpo 7407 1st c1st 7972 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pr 5420 ax-un 7722 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-iota 6489 df-fun 6539 df-fv 6545 df-ov 7408 df-oprab 7409 df-mpo 7410 df-1st 7974 df-2nd 7975 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |