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

Theorem ov6g 7616
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 7454 . 2 (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2 eqid 2763 . . . . . 6 𝑆 = 𝑆
3 biidd 265 . . . . . . 7 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑆 = 𝑆 ↔ 𝑆 = 𝑆))
43copsex2g 5472 . . . . . 6 ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐻) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆) ↔ 𝑆 = 𝑆))
52, 4mpbiri 261 . . . . 5 ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐻) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆))
653adant3 1150 . . . 4 ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆))
76adantr 486 . . 3 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆 ∈ 𝐽) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆))
8 eqeq1 2767 . . . . . . . 8 (𝑤 = ⟨𝐴, 𝐵⟩ → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ ⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩))
98anbi1d 643 . . . . . . 7 (𝑤 = ⟨𝐴, 𝐵⟩ → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
10 ov6g.1 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → 𝑅 = 𝑆)
1110eqeq2d 2774 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → (𝑧 = 𝑅 ↔ 𝑧 = 𝑆))
1211eqcoms 2771 . . . . . . . 8 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝑧 = 𝑅 ↔ 𝑧 = 𝑆))
1312pm5.32i 585 . . . . . . 7 ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆))
149, 13bitrdi 290 . . . . . 6 (𝑤 = ⟨𝐴, 𝐵⟩ → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆)))
15142exbidv 1959 . . . . 5 (𝑤 = ⟨𝐴, 𝐵⟩ → (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅) ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆)))
16 eqeq1 2767 . . . . . . 7 (𝑧 = 𝑆 → (𝑧 = 𝑆 ↔ 𝑆 = 𝑆))
1716anbi2d 642 . . . . . 6 (𝑧 = 𝑆 → ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆)))
18172exbidv 1959 . . . . 5 (𝑧 = 𝑆 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑆) ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆)))
19 moeq 3668 . . . . . . 7 ∃*𝑧 𝑧 = 𝑅
2019mosubop 5490 . . . . . 6 ∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)
2120a1i 11 . . . . 5 (𝑤 ∈ 𝐶 → ∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅))
22 ov6g.2 . . . . . 6 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅)}
23 dfoprab2 7509 . . . . . 6 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅)} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅))}
24 eleq1 2852 . . . . . . . . . . . 12 (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑤 ∈ 𝐶 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
2524anbi1d 643 . . . . . . . . . . 11 (𝑤 = ⟨𝑥, 𝑦⟩ → ((𝑤 ∈ 𝐶 ∧ 𝑧 = 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅)))
2625pm5.32i 585 . . . . . . . . . 10 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤 ∈ 𝐶 ∧ 𝑧 = 𝑅)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅)))
27 an12 658 . . . . . . . . . 10 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤 ∈ 𝐶 ∧ 𝑧 = 𝑅)) ↔ (𝑤 ∈ 𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
2826, 27bitr3i 280 . . . . . . . . 9 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅)) ↔ (𝑤 ∈ 𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
29282exbii 1882 . . . . . . . 8 (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅)) ↔ ∃𝑥∃𝑦(𝑤 ∈ 𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
30 19.42vv 1992 . . . . . . . 8 (∃𝑥∃𝑦(𝑤 ∈ 𝐶 ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)) ↔ (𝑤 ∈ 𝐶 ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
3129, 30bitri 278 . . . . . . 7 (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅)) ↔ (𝑤 ∈ 𝐶 ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅)))
3231opabbii 5178 . . . . . 6 {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ 𝑧 = 𝑅))} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ 𝐶 ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅))}
3322, 23, 323eqtri 2790 . . . . 5 𝐹 = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ 𝐶 ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑧 = 𝑅))}
3415, 18, 21, 33fvopab3ig 7020 . . . 4 ((⟨𝐴, 𝐵⟩ ∈ 𝐶 ∧ 𝑆 ∈ 𝐽) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆) → (𝐹‘⟨𝐴, 𝐵⟩) = 𝑆))
35343ad2antl3 1206 . . 3 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆 ∈ 𝐽) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝑆 = 𝑆) → (𝐹‘⟨𝐴, 𝐵⟩) = 𝑆))
367, 35mpd 16 . 2 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆 ∈ 𝐽) → (𝐹‘⟨𝐴, 𝐵⟩) = 𝑆)
371, 36eqtrid 2810 1 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐻 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶) ∧ 𝑆 ∈ 𝐽) → (𝐴𝐹𝐵) = 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃*wmo 2565  ⟨cop 4840  {copab 5173  ‘cfv 6566  (class class class)co 7451  {coprab 7452
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator