| 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 2612 | . . . . . 6 ⊢ (∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃*𝑧𝜓)) | |
| 5 | 3, 4 | sylibr 234 | . . . . 5 ⊢ (𝜑 → ∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)) |
| 6 | 5 | alrimivv 1928 | . . . 4 ⊢ (𝜑 → ∀𝑥∀𝑦∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)) |
| 7 | funoprabg 7490 | . . . 4 ⊢ (∀𝑥∀𝑦∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) | |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) |
| 9 | dmoprabss 7473 | . . . 4 ⊢ dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ⊆ (𝐴 × 𝐵) | |
| 10 | oprabexd.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 11 | oprabexd.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 12 | 10, 11 | xpexd 7707 | . . . 4 ⊢ (𝜑 → (𝐴 × 𝐵) ∈ V) |
| 13 | ssexg 5273 | . . . 4 ⊢ ((dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ⊆ (𝐴 × 𝐵) ∧ (𝐴 × 𝐵) ∈ V) → dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) | |
| 14 | 9, 12, 13 | sylancr 587 | . . 3 ⊢ (𝜑 → dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) |
| 15 | funex 7175 | . . 3 ⊢ ((Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∧ dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) | |
| 16 | 8, 14, 15 | syl2anc 584 | . 2 ⊢ (𝜑 → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) |
| 17 | 1, 16 | eqeltrd 2828 | 1 ⊢ (𝜑 → 𝐹 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∀wal 1538 = wceq 1540 ∈ wcel 2109 ∃*wmo 2531 Vcvv 3444 ⊆ wss 3911 × cxp 5629 dom cdm 5631 Fun wfun 6493 {coprab 7370 |
| 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 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-oprab 7373 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |