MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  oprabex3 Structured version   Visualization version   GIF version

Theorem oprabex3 7930
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
StepHypRef Expression
1 oprabex3.1 . . 3 𝐻 ∈ V
21, 1xpex 7707 . 2 (𝐻 × 𝐻) ∈ V
3 moeq 3653 . . . . . 6 ∃*𝑧 𝑧 = 𝑅
43mosubop 5465 . . . . 5 ∃*𝑧𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)
54mosubop 5465 . . . 4 ∃*𝑧𝑤𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅))
6 anass 468 . . . . . . . 8 (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
762exbii 1851 . . . . . . 7 (∃𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃𝑢𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
8 19.42vv 1959 . . . . . . 7 (∃𝑢𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
97, 8bitri 275 . . . . . 6 (∃𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
1092exbii 1851 . . . . 5 (∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃𝑤𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
1110mobii 2548 . . . 4 (∃*𝑧𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃*𝑧𝑤𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
125, 11mpbir 231 . . 3 ∃*𝑧𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅)
1312a1i 11 . 2 ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) → ∃*𝑧𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅))
14 oprabex3.2 . 2 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅))}
152, 2, 13, 14oprabex 7929 1 𝐹 ∈ V
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1542  wex 1781  wcel 2114  ∃*wmo 2537  Vcvv 3429  cop 4573   × cxp 5629  {coprab 7368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  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 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-oprab 7371
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator