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

Theorem eqgfval 19108
Description: Value of the subgroup left coset equivalence relation. (Contributed by Mario Carneiro, 15-Jan-2015.)
Hypotheses
Ref Expression
eqgval.x 𝑋 = (Base‘𝐺)
eqgval.n 𝑁 = (invg𝐺)
eqgval.p + = (+g𝐺)
eqgval.r 𝑅 = (𝐺 ~QG 𝑆)
Assertion
Ref Expression
eqgfval ((𝐺𝑉𝑆𝑋) → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)})
Distinct variable groups:   𝑥,𝑦,𝐺   𝑥,𝑁,𝑦   𝑥,𝑆,𝑦   𝑥, + ,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝑅(𝑥,𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem eqgfval
Dummy variables 𝑔 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3468 . 2 (𝐺𝑉𝐺 ∈ V)
2 eqgval.x . . . 4 𝑋 = (Base‘𝐺)
32fvexi 6872 . . 3 𝑋 ∈ V
43ssex 5276 . 2 (𝑆𝑋𝑆 ∈ V)
5 eqgval.r . . 3 𝑅 = (𝐺 ~QG 𝑆)
6 simpl 482 . . . . . . . . 9 ((𝑔 = 𝐺𝑠 = 𝑆) → 𝑔 = 𝐺)
76fveq2d 6862 . . . . . . . 8 ((𝑔 = 𝐺𝑠 = 𝑆) → (Base‘𝑔) = (Base‘𝐺))
87, 2eqtr4di 2782 . . . . . . 7 ((𝑔 = 𝐺𝑠 = 𝑆) → (Base‘𝑔) = 𝑋)
98sseq2d 3979 . . . . . 6 ((𝑔 = 𝐺𝑠 = 𝑆) → ({𝑥, 𝑦} ⊆ (Base‘𝑔) ↔ {𝑥, 𝑦} ⊆ 𝑋))
106fveq2d 6862 . . . . . . . . 9 ((𝑔 = 𝐺𝑠 = 𝑆) → (+g𝑔) = (+g𝐺))
11 eqgval.p . . . . . . . . 9 + = (+g𝐺)
1210, 11eqtr4di 2782 . . . . . . . 8 ((𝑔 = 𝐺𝑠 = 𝑆) → (+g𝑔) = + )
136fveq2d 6862 . . . . . . . . . 10 ((𝑔 = 𝐺𝑠 = 𝑆) → (invg𝑔) = (invg𝐺))
14 eqgval.n . . . . . . . . . 10 𝑁 = (invg𝐺)
1513, 14eqtr4di 2782 . . . . . . . . 9 ((𝑔 = 𝐺𝑠 = 𝑆) → (invg𝑔) = 𝑁)
1615fveq1d 6860 . . . . . . . 8 ((𝑔 = 𝐺𝑠 = 𝑆) → ((invg𝑔)‘𝑥) = (𝑁𝑥))
17 eqidd 2730 . . . . . . . 8 ((𝑔 = 𝐺𝑠 = 𝑆) → 𝑦 = 𝑦)
1812, 16, 17oveq123d 7408 . . . . . . 7 ((𝑔 = 𝐺𝑠 = 𝑆) → (((invg𝑔)‘𝑥)(+g𝑔)𝑦) = ((𝑁𝑥) + 𝑦))
19 simpr 484 . . . . . . 7 ((𝑔 = 𝐺𝑠 = 𝑆) → 𝑠 = 𝑆)
2018, 19eleq12d 2822 . . . . . 6 ((𝑔 = 𝐺𝑠 = 𝑆) → ((((invg𝑔)‘𝑥)(+g𝑔)𝑦) ∈ 𝑠 ↔ ((𝑁𝑥) + 𝑦) ∈ 𝑆))
219, 20anbi12d 632 . . . . 5 ((𝑔 = 𝐺𝑠 = 𝑆) → (({𝑥, 𝑦} ⊆ (Base‘𝑔) ∧ (((invg𝑔)‘𝑥)(+g𝑔)𝑦) ∈ 𝑠) ↔ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)))
2221opabbidv 5173 . . . 4 ((𝑔 = 𝐺𝑠 = 𝑆) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝑔) ∧ (((invg𝑔)‘𝑥)(+g𝑔)𝑦) ∈ 𝑠)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)})
23 df-eqg 19057 . . . 4 ~QG = (𝑔 ∈ V, 𝑠 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝑔) ∧ (((invg𝑔)‘𝑥)(+g𝑔)𝑦) ∈ 𝑠)})
243, 3xpex 7729 . . . . 5 (𝑋 × 𝑋) ∈ V
25 simpl 482 . . . . . . . 8 (({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆) → {𝑥, 𝑦} ⊆ 𝑋)
26 vex 3451 . . . . . . . . 9 𝑥 ∈ V
27 vex 3451 . . . . . . . . 9 𝑦 ∈ V
2826, 27prss 4784 . . . . . . . 8 ((𝑥𝑋𝑦𝑋) ↔ {𝑥, 𝑦} ⊆ 𝑋)
2925, 28sylibr 234 . . . . . . 7 (({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆) → (𝑥𝑋𝑦𝑋))
3029ssopab2i 5510 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑋𝑦𝑋)}
31 df-xp 5644 . . . . . 6 (𝑋 × 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑋𝑦𝑋)}
3230, 31sseqtrri 3996 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)} ⊆ (𝑋 × 𝑋)
3324, 32ssexi 5277 . . . 4 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)} ∈ V
3422, 23, 33ovmpoa 7544 . . 3 ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (𝐺 ~QG 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)})
355, 34eqtrid 2776 . 2 ((𝐺 ∈ V ∧ 𝑆 ∈ V) → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)})
361, 4, 35syl2an 596 1 ((𝐺𝑉𝑆𝑋) → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁𝑥) + 𝑦) ∈ 𝑆)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3447  wss 3914  {cpr 4591  {copab 5169   × cxp 5636  cfv 6511  (class class class)co 7387  Basecbs 17179  +gcplusg 17220  invgcminusg 18866   ~QG cqg 19054
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-eqg 19057
This theorem is referenced by:  eqgval  19109  eqg0subg  19128  quslsm  33376  oppreqg  33454
  Copyright terms: Public domain W3C validator