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 7594 | . 2 ⊢ (𝐻 × 𝐻) ∈ V |
3 | moeq 3645 | . . . . . 6 ⊢ ∃*𝑧 𝑧 = 𝑅 | |
4 | 3 | mosubop 5427 | . . . . 5 ⊢ ∃*𝑧∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅) |
5 | 4 | mosubop 5427 | . . . 4 ⊢ ∃*𝑧∃𝑤∃𝑣(𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅)) |
6 | anass 468 | . . . . . . . 8 ⊢ (((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ (𝑥 = 〈𝑤, 𝑣〉 ∧ (𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) | |
7 | 6 | 2exbii 1854 | . . . . . . 7 ⊢ (∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ ∃𝑢∃𝑓(𝑥 = 〈𝑤, 𝑣〉 ∧ (𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
8 | 19.42vv 1964 | . . . . . . 7 ⊢ (∃𝑢∃𝑓(𝑥 = 〈𝑤, 𝑣〉 ∧ (𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅)) ↔ (𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) | |
9 | 7, 8 | bitri 274 | . . . . . 6 ⊢ (∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ (𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
10 | 9 | 2exbii 1854 | . . . . 5 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ ∃𝑤∃𝑣(𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
11 | 10 | mobii 2549 | . . . 4 ⊢ (∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) ↔ ∃*𝑧∃𝑤∃𝑣(𝑥 = 〈𝑤, 𝑣〉 ∧ ∃𝑢∃𝑓(𝑦 = 〈𝑢, 𝑓〉 ∧ 𝑧 = 𝑅))) |
12 | 5, 11 | mpbir 230 | . . 3 ⊢ ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅) |
13 | 12 | a1i 11 | . 2 ⊢ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) → ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅)) |
14 | oprabex3.2 | . 2 ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 𝑅))} | |
15 | 2, 2, 13, 14 | oprabex 7805 | 1 ⊢ 𝐹 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 = wceq 1541 ∃wex 1785 ∈ wcel 2109 ∃*wmo 2539 Vcvv 3430 〈cop 4572 × cxp 5586 {coprab 7269 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-rep 5213 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4845 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-id 5488 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-oprab 7272 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |