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

Theorem ov6g 5691
Description: The value of an operation class abstraction. Special case. (Contributed by NM, 13-Nov-2006.)
Hypotheses
Ref Expression
ov6g.1 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → 𝑅 = 𝑆)
ov6g.2 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)}
Assertion
Ref Expression
ov6g (((𝐴𝐺𝐵𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆𝐽) → (𝐴𝐹𝐵) = 𝑆)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑧,𝑅   𝑥,𝑆,𝑦,𝑧
Allowed substitution hints:   𝑅(𝑥,𝑦)   𝐹(𝑥,𝑦,𝑧)   𝐺(𝑥,𝑦,𝑧)   𝐻(𝑥,𝑦,𝑧)   𝐽(𝑥,𝑦,𝑧)

Proof of Theorem ov6g
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 df-ov 5568 . 2 (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2 eqid 2083 . . . . . 6 𝑆 = 𝑆
3 biidd 170 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑆 = 𝑆𝑆 = 𝑆))
43copsex2g 4030 . . . . . 6 ((𝐴𝐺𝐵𝐻) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆) ↔ 𝑆 = 𝑆))
52, 4mpbiri 166 . . . . 5 ((𝐴𝐺𝐵𝐻) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆))
653adant3 959 . . . 4 ((𝐴𝐺𝐵𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆))
76adantr 270 . . 3 (((𝐴𝐺𝐵𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆𝐽) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆))
8 eqeq1 2089 . . . . . . . 8 (𝑤 = ⟨𝐴, 𝐵⟩ → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ ⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩))
98anbi1d 453 . . . . . . 7 (𝑤 = ⟨𝐴, 𝐵⟩ → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
10 ov6g.1 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → 𝑅 = 𝑆)
1110eqeq2d 2094 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → (𝑧 = 𝑅𝑧 = 𝑆))
1211eqcoms 2086 . . . . . . . 8 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝑧 = 𝑅𝑧 = 𝑆))
1312pm5.32i 442 . . . . . . 7 ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆))
149, 13syl6bb 194 . . . . . 6 (𝑤 = ⟨𝐴, 𝐵⟩ → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆)))
15142exbidv 1791 . . . . 5 (𝑤 = ⟨𝐴, 𝐵⟩ → (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆)))
16 eqeq1 2089 . . . . . . 7 (𝑧 = 𝑆 → (𝑧 = 𝑆𝑆 = 𝑆))
1716anbi2d 452 . . . . . 6 (𝑧 = 𝑆 → ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆)))
18172exbidv 1791 . . . . 5 (𝑧 = 𝑆 → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆) ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆)))
19 moeq 2777 . . . . . . 7 ∃*𝑧 𝑧 = 𝑅
2019mosubop 4453 . . . . . 6 ∃*𝑧𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)
2120a1i 9 . . . . 5 (𝑤𝐶 → ∃*𝑧𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅))
22 ov6g.2 . . . . . 6 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)}
23 dfoprab2 5605 . . . . . 6 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅))}
24 eleq1 2145 . . . . . . . . . . . 12 (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑤𝐶 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
2524anbi1d 453 . . . . . . . . . . 11 (𝑤 = ⟨𝑥, 𝑦⟩ → ((𝑤𝐶𝑧 = 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)))
2625pm5.32i 442 . . . . . . . . . 10 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤𝐶𝑧 = 𝑅)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)))
27 an12 526 . . . . . . . . . 10 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤𝐶𝑧 = 𝑅)) ↔ (𝑤𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
2826, 27bitr3i 184 . . . . . . . . 9 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)) ↔ (𝑤𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
29282exbii 1538 . . . . . . . 8 (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)) ↔ ∃𝑥𝑦(𝑤𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
30 19.42vv 1831 . . . . . . . 8 (∃𝑥𝑦(𝑤𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)) ↔ (𝑤𝐶 ∧ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
3129, 30bitri 182 . . . . . . 7 (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅)) ↔ (𝑤𝐶 ∧ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
3231opabbii 3866 . . . . . 6 {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑧 = 𝑅))} = {⟨𝑤, 𝑧⟩ ∣ (𝑤𝐶 ∧ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅))}
3322, 23, 323eqtri 2107 . . . . 5 𝐹 = {⟨𝑤, 𝑧⟩ ∣ (𝑤𝐶 ∧ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅))}
3415, 18, 21, 33fvopab3ig 5300 . . . 4 ((⟨𝐴, 𝐵⟩ ∈ 𝐶𝑆𝐽) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆) → (𝐹‘⟨𝐴, 𝐵⟩) = 𝑆))
35343ad2antl3 1103 . . 3 (((𝐴𝐺𝐵𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆𝐽) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆) → (𝐹‘⟨𝐴, 𝐵⟩) = 𝑆))
367, 35mpd 13 . 2 (((𝐴𝐺𝐵𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆𝐽) → (𝐹‘⟨𝐴, 𝐵⟩) = 𝑆)
371, 36syl5eq 2127 1 (((𝐴𝐺𝐵𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆𝐽) → (𝐴𝐹𝐵) = 𝑆)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103  w3a 920   = wceq 1285  wex 1422  wcel 1434  ∃*wmo 1944  cop 3420  {copab 3859  cfv 4953  (class class class)co 5565  {coprab 5566
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 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3917  ax-pow 3969  ax-pr 3993
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-v 2613  df-sbc 2826  df-un 2987  df-in 2989  df-ss 2996  df-pw 3403  df-sn 3423  df-pr 3424  df-op 3426  df-uni 3623  df-br 3807  df-opab 3861  df-id 4077  df-xp 4398  df-rel 4399  df-cnv 4400  df-co 4401  df-dm 4402  df-iota 4918  df-fun 4955  df-fv 4961  df-ov 5568  df-oprab 5569
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator