| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sprmpod | Structured version Visualization version GIF version | ||
| Description: The extension of a binary relation which is the value of an operation given in maps-to notation. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 20-Jun-2019.) |
| Ref | Expression |
|---|---|
| sprmpod.1 | ⊢ 𝑀 = (𝑣 ∈ V, 𝑒 ∈ V ↦ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)}) |
| sprmpod.2 | ⊢ ((𝜑 ∧ 𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝜒 ↔ 𝜓)) |
| sprmpod.3 | ⊢ (𝜑 → (𝑉 ∈ V ∧ 𝐸 ∈ V)) |
| sprmpod.4 | ⊢ (𝜑 → ∀𝑥∀𝑦(𝑥(𝑉𝑅𝐸)𝑦 → 𝜃)) |
| sprmpod.5 | ⊢ (𝜑 → {〈𝑥, 𝑦〉 ∣ 𝜃} ∈ V) |
| Ref | Expression |
|---|---|
| sprmpod | ⊢ (𝜑 → (𝑉𝑀𝐸) = {〈𝑥, 𝑦〉 ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sprmpod.1 | . . 3 ⊢ 𝑀 = (𝑣 ∈ V, 𝑒 ∈ V ↦ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)}) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝜑 → 𝑀 = (𝑣 ∈ V, 𝑒 ∈ V ↦ {〈𝑥, 𝑦〉 ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)})) |
| 3 | oveq12 7429 | . . . . . 6 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑣𝑅𝑒) = (𝑉𝑅𝐸)) | |
| 4 | 3 | breqd 5113 | . . . . 5 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑥(𝑣𝑅𝑒)𝑦 ↔ 𝑥(𝑉𝑅𝐸)𝑦)) |
| 5 | 4 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → (𝑥(𝑣𝑅𝑒)𝑦 ↔ 𝑥(𝑉𝑅𝐸)𝑦)) |
| 6 | sprmpod.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝜒 ↔ 𝜓)) | |
| 7 | 6 | 3expb 1138 | . . . 4 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → (𝜒 ↔ 𝜓)) |
| 8 | 5, 7 | anbi12d 644 | . . 3 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → ((𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒) ↔ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓))) |
| 9 | 8 | opabbidv 5170 | . 2 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → {〈𝑥, 𝑦〉 ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)} = {〈𝑥, 𝑦〉 ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)}) |
| 10 | sprmpod.3 | . . 3 ⊢ (𝜑 → (𝑉 ∈ V ∧ 𝐸 ∈ V)) | |
| 11 | 10 | simpld 500 | . 2 ⊢ (𝜑 → 𝑉 ∈ V) |
| 12 | 10 | simprd 501 | . 2 ⊢ (𝜑 → 𝐸 ∈ V) |
| 13 | sprmpod.4 | . . 3 ⊢ (𝜑 → ∀𝑥∀𝑦(𝑥(𝑉𝑅𝐸)𝑦 → 𝜃)) | |
| 14 | sprmpod.5 | . . 3 ⊢ (𝜑 → {〈𝑥, 𝑦〉 ∣ 𝜃} ∈ V) | |
| 15 | opabbrex 7473 | . . 3 ⊢ ((∀𝑥∀𝑦(𝑥(𝑉𝑅𝐸)𝑦 → 𝜃) ∧ {〈𝑥, 𝑦〉 ∣ 𝜃} ∈ V) → {〈𝑥, 𝑦〉 ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)} ∈ V) | |
| 16 | 13, 14, 15 | syl2anc 596 | . 2 ⊢ (𝜑 → {〈𝑥, 𝑦〉 ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)} ∈ V) |
| 17 | 2, 9, 11, 12, 16 | ovmpod 7572 | 1 ⊢ (𝜑 → (𝑉𝑀𝐸) = {〈𝑥, 𝑦〉 ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∀wal 1567 = wceq 1569 ∈ wcel 2144 Vcvv 3450 class class class wbr 5102 {copab 5166 (class class class)co 7420 ∈ cmpo 7422 |
| 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-pr 5390 |
| 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-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |