Theorem oprabex3 6366

Description: Existence of an operation class abstraction (special case). (Contributed by NM, 19-Oct-2004.)

Hypotheses

Ref	Expression
oprabex3.1	⊢ 𝐻 ∈ V
oprabex3.2	⊢ 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅))}

Assertion

Ref	Expression
oprabex3	⊢ 𝐹 ∈ V

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝑓,𝐻   𝑥,𝑅,𝑦,𝑧

Allowed substitution hints:   𝑅(𝑤, 𝑣, 𝑢, 𝑓)   𝐹(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑢, 𝑓)

Proof of Theorem oprabex3

Step	Hyp	Ref	Expression
1		oprabex3.1	. . 3 ⊢ 𝐻 ∈ V
2	1, 1	xpex 4893	. 2 ⊢ (𝐻 × 𝐻) ∈ V
3		moeq 3001	. . . . . 6 ⊢ ∃*𝑧 𝑧 = 𝑅
4	3	mosubop 4843	. . . . 5 ⊢ ∃*𝑧∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)
5	4	mosubop 4843	. . . 4 ⊢ ∃*𝑧∃𝑤∃𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅))
6		anass 405	. . . . . . . 8 ⊢ (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
7	6	2exbii 1659	. . . . . . 7 ⊢ (∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃𝑢∃𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
8		19.42vv 1967	. . . . . . 7 ⊢ (∃𝑢∃𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
9	7, 8	bitri 184	. . . . . 6 ⊢ (∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
10	9	2exbii 1659	. . . . 5 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃𝑤∃𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
11	10	mobii 2123	. . . 4 ⊢ (∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃*𝑧∃𝑤∃𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
12	5, 11	mpbir 146	. . 3 ⊢ ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅)
13	12	a1i 9	. 2 ⊢ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) → ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅))
14		oprabex3.2	. 2 ⊢ 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅))}
15	2, 2, 13, 14	oprabex 6365	1 ⊢ 𝐹 ∈ V

This proof depends on syntax axioms:   ∧ wa 104   = wceq 1402  ∃wex 1545  ∃*wmo 2087   ∈ wcel 2209  Vcvv 2821  ⟨cop 3712   × cxp 4774  {coprab 6089

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-oprab 6092

This theorem is used by:  addvalex  8217