Theorem eqgfval 13428

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.

Step	Hyp	Ref	Expression
1		eqgval.r	. 2 ⊢ 𝑅 = (𝐺 ~QG 𝑆)
2		elex 2774	. . . 4 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
3	2	adantr 276	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → 𝐺 ∈ V)
4		eqgval.x	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
5		basfn 12761	. . . . . . 7 ⊢ Base Fn V
6		funfvex 5578	. . . . . . . 8 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
7	6	funfni 5361	. . . . . . 7 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
8	5, 2, 7	sylancr 414	. . . . . 6 ⊢ (𝐺 ∈ 𝑉 → (Base‘𝐺) ∈ V)
9	4, 8	eqeltrid 2283	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → 𝑋 ∈ V)
10	9	adantr 276	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → 𝑋 ∈ V)
11		simpr 110	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ 𝑋)
12	10, 11	ssexd 4174	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → 𝑆 ∈ V)
13		xpexg 4778	. . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝑋 ∈ V) → (𝑋 × 𝑋) ∈ V)
14	10, 10, 13	syl2anc 411	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → (𝑋 × 𝑋) ∈ V)
15		simpl 109	. . . . . . . 8 ⊢ (({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆) → {𝑥, 𝑦} ⊆ 𝑋)
16		vex 2766	. . . . . . . . 9 ⊢ 𝑥 ∈ V
17		vex 2766	. . . . . . . . 9 ⊢ 𝑦 ∈ V
18	16, 17	prss 3779	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ↔ {𝑥, 𝑦} ⊆ 𝑋)
19	15, 18	sylibr 134	. . . . . . 7 ⊢ (({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆) → (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋))
20	19	ssopab2i 4313	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)}
21		df-xp 4670	. . . . . 6 ⊢ (𝑋 × 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)}
22	20, 21	sseqtrri 3219	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)} ⊆ (𝑋 × 𝑋)
23	22	a1i 9	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)} ⊆ (𝑋 × 𝑋))
24	14, 23	ssexd 4174	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)} ∈ V)
25		simpl 109	. . . . . . . . 9 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → 𝑔 = 𝐺)
26	25	fveq2d 5565	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (Base‘𝑔) = (Base‘𝐺))
27	26, 4	eqtr4di 2247	. . . . . . 7 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (Base‘𝑔) = 𝑋)
28	27	sseq2d 3214	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → ({𝑥, 𝑦} ⊆ (Base‘𝑔) ↔ {𝑥, 𝑦} ⊆ 𝑋))
29	25	fveq2d 5565	. . . . . . . . 9 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (+g‘𝑔) = (+g‘𝐺))
30		eqgval.p	. . . . . . . . 9 ⊢ + = (+g‘𝐺)
31	29, 30	eqtr4di 2247	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (+g‘𝑔) = + )
32	25	fveq2d 5565	. . . . . . . . . 10 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (invg‘𝑔) = (invg‘𝐺))
33		eqgval.n	. . . . . . . . . 10 ⊢ 𝑁 = (invg‘𝐺)
34	32, 33	eqtr4di 2247	. . . . . . . . 9 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (invg‘𝑔) = 𝑁)
35	34	fveq1d 5563	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → ((invg‘𝑔)‘𝑥) = (𝑁‘𝑥))
36		eqidd 2197	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → 𝑦 = 𝑦)
37	31, 35, 36	oveq123d 5946	. . . . . . 7 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (((invg‘𝑔)‘𝑥)(+g‘𝑔)𝑦) = ((𝑁‘𝑥) + 𝑦))
38		simpr 110	. . . . . . 7 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆)
39	37, 38	eleq12d 2267	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → ((((invg‘𝑔)‘𝑥)(+g‘𝑔)𝑦) ∈ 𝑠 ↔ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆))
40	28, 39	anbi12d 473	. . . . 5 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (({𝑥, 𝑦} ⊆ (Base‘𝑔) ∧ (((invg‘𝑔)‘𝑥)(+g‘𝑔)𝑦) ∈ 𝑠) ↔ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)))
41	40	opabbidv 4100	. . . 4 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝑔) ∧ (((invg‘𝑔)‘𝑥)(+g‘𝑔)𝑦) ∈ 𝑠)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)})
42		df-eqg 13378	. . . 4 ⊢ ~QG = (𝑔 ∈ V, 𝑠 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝑔) ∧ (((invg‘𝑔)‘𝑥)(+g‘𝑔)𝑦) ∈ 𝑠)})
43	41, 42	ovmpoga 6056	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V ∧ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)} ∈ V) → (𝐺 ~QG 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)})
44	3, 12, 24, 43	syl3anc 1249	. 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → (𝐺 ~QG 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)})
45	1, 44	eqtrid 2241	1 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ⊆ 𝑋) → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑋 ∧ ((𝑁‘𝑥) + 𝑦) ∈ 𝑆)})

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2167  Vcvv 2763   ⊆ wss 3157  {cpr 3624  {copab 4094   × cxp 4662   Fn wfn 5254  ‘cfv 5259  (class class class)co 5925  Basecbs 12703  +_gcplusg 12780  inv_gcminusg 13203   ~_QG cqg 13375

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-inn 9008  df-ndx 12706  df-slot 12707  df-base 12709  df-eqg 13378

This theorem is referenced by:  eqgval  13429