| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oprabex3 | Structured version Visualization version GIF version | ||
| Description: Existence of an operation class abstraction (special case). (Contributed by NM, 19-Oct-2004.) |
| Ref | Expression |
|---|---|
| oprabex3.1 | ⊢ 𝐻 ∈ V |
| oprabex3.2 | ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅))} |
| Ref | Expression |
|---|---|
| oprabex3 | ⊢ 𝐹 ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oprabex3.1 | . . 3 ⊢ 𝐻 ∈ V | |
| 2 | 1, 1 | xpex 7752 | . 2 ⊢ (𝐻 × 𝐻) ∈ V |
| 3 | moeq 3665 | . . . . . 6 ⊢ ∃*𝑧 𝑧 = 𝑅 | |
| 4 | 3 | mosubop 5488 | . . . . 5 ⊢ ∃*𝑧∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅) |
| 5 | 4 | mosubop 5488 | . . . 4 ⊢ ∃*𝑧∃𝑤∃𝑣(𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅)) |
| 6 | anass 474 | . . . . . . . 8 ⊢ (((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ (𝑥 = 〈𝑤, 𝑣〉 ∧ (𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) | |
| 7 | 6 | 2exbii 1882 | . . . . . . 7 ⊢ (∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ ∃𝑢∃𝑓(𝑥 = 〈𝑤, 𝑣〉 ∧ (𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
| 8 | 19.42vv 1990 | . . . . . . 7 ⊢ (∃𝑢∃𝑓(𝑥 = 〈𝑤, 𝑣〉 ∧ (𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅)) ↔ (𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) | |
| 9 | 7, 8 | bitri 278 | . . . . . 6 ⊢ (∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ (𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
| 10 | 9 | 2exbii 1882 | . . . . 5 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ ∃𝑤∃𝑣(𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
| 11 | 10 | mobii 2573 | . . . 4 ⊢ (∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ ∃*𝑧∃𝑤∃𝑣(𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
| 12 | 5, 11 | mpbir 234 | . . 3 ⊢ ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) |
| 13 | 12 | a1i 11 | . 2 ⊢ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) → ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅)) |
| 14 | oprabex3.2 | . 2 ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅))} | |
| 15 | 2, 2, 13, 14 | oprabex 7973 | 1 ⊢ 𝐹 ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ∃*wmo 2562 Vcvv 3450 〈cop 4590 × cxp 5653 {coprab 7414 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-oprab 7417 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |