| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oprabexd | Structured version Visualization version GIF version | ||
| Description: Existence of an operator abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by AV, 9-Aug-2024.) |
| Ref | Expression |
|---|---|
| oprabexd.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| oprabexd.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| oprabexd.3 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑧𝜓) |
| oprabexd.4 | ⊢ (𝜑 → 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) |
| Ref | Expression |
|---|---|
| oprabexd | ⊢ (𝜑 → 𝐹 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oprabexd.4 | . 2 ⊢ (𝜑 → 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) | |
| 2 | oprabexd.3 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑧𝜓) | |
| 3 | 2 | ex 412 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃*𝑧𝜓)) |
| 4 | moanimv 2614 | . . . . . 6 ⊢ (∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃*𝑧𝜓)) | |
| 5 | 3, 4 | sylibr 234 | . . . . 5 ⊢ (𝜑 → ∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)) |
| 6 | 5 | alrimivv 1929 | . . . 4 ⊢ (𝜑 → ∀𝑥∀𝑦∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)) |
| 7 | funoprabg 7467 | . . . 4 ⊢ (∀𝑥∀𝑦∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) | |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) |
| 9 | dmoprabss 7450 | . . . 4 ⊢ dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ⊆ (𝐴 × 𝐵) | |
| 10 | oprabexd.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 11 | oprabexd.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 12 | 10, 11 | xpexd 7684 | . . . 4 ⊢ (𝜑 → (𝐴 × 𝐵) ∈ V) |
| 13 | ssexg 5259 | . . . 4 ⊢ ((dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ⊆ (𝐴 × 𝐵) ∧ (𝐴 × 𝐵) ∈ V) → dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) | |
| 14 | 9, 12, 13 | sylancr 587 | . . 3 ⊢ (𝜑 → dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) |
| 15 | funex 7153 | . . 3 ⊢ ((Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∧ dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) | |
| 16 | 8, 14, 15 | syl2anc 584 | . 2 ⊢ (𝜑 → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) |
| 17 | 1, 16 | eqeltrd 2831 | 1 ⊢ (𝜑 → 𝐹 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∀wal 1539 = wceq 1541 ∈ wcel 2111 ∃*wmo 2533 Vcvv 3436 ⊆ wss 3897 × cxp 5612 dom cdm 5614 Fun wfun 6475 {coprab 7347 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-oprab 7350 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |