ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oprabex3 GIF version

Theorem oprabex3 5900
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 4553 . 2 (𝐻 × 𝐻) ∈ V
3 moeq 2790 . . . . . 6 ∃*𝑧 𝑧 = 𝑅
43mosubop 4504 . . . . 5 ∃*𝑧𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)
54mosubop 4504 . . . 4 ∃*𝑧𝑤𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅))
6 anass 393 . . . . . . . 8 (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
762exbii 1542 . . . . . . 7 (∃𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃𝑢𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
8 19.42vv 1836 . . . . . . 7 (∃𝑢𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
97, 8bitri 182 . . . . . 6 (∃𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
1092exbii 1542 . . . . 5 (∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃𝑤𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
1110mobii 1985 . . . 4 (∃*𝑧𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅) ↔ ∃*𝑧𝑤𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = 𝑅)))
125, 11mpbir 144 . . 3 ∃*𝑧𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅)
1312a1i 9 . 2 ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) → ∃*𝑧𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅))
14 oprabex3.2 . 2 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (𝐻 × 𝐻) ∧ 𝑦 ∈ (𝐻 × 𝐻)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = 𝑅))}
152, 2, 13, 14oprabex 5899 1 𝐹 ∈ V
Colors of variables: wff set class
Syntax hints:  wa 102   = wceq 1289  wex 1426  wcel 1438  ∃*wmo 1949  Vcvv 2619  cop 3449   × cxp 4436  {coprab 5653
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3954  ax-sep 3957  ax-pow 4009  ax-pr 4036  ax-un 4260
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2841  df-csb 2934  df-un 3003  df-in 3005  df-ss 3012  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-iun 3732  df-br 3846  df-opab 3900  df-mpt 3901  df-id 4120  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-res 4450  df-ima 4451  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-f1 5020  df-fo 5021  df-f1o 5022  df-fv 5023  df-oprab 5656
This theorem is referenced by:  addvalex  7379
  Copyright terms: Public domain W3C validator