Theorem eroprf 6594

Description: Functionality of an operation defined on equivalence classes. (Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro, 30-Dec-2014.)

Hypotheses

Ref	Expression
eropr.1	⊢ 𝐽 = (𝐴 / 𝑅)
eropr.2	⊢ 𝐾 = (𝐵 / 𝑆)
eropr.3	⊢ (𝜑 → 𝑇 ∈ 𝑍)
eropr.4	⊢ (𝜑 → 𝑅 Er 𝑈)
eropr.5	⊢ (𝜑 → 𝑆 Er 𝑉)
eropr.6	⊢ (𝜑 → 𝑇 Er 𝑊)
eropr.7	⊢ (𝜑 → 𝐴 ⊆ 𝑈)
eropr.8	⊢ (𝜑 → 𝐵 ⊆ 𝑉)
eropr.9	⊢ (𝜑 → 𝐶 ⊆ 𝑊)
eropr.10	⊢ (𝜑 → + :(𝐴 × 𝐵)⟶𝐶)
eropr.11	⊢ ((𝜑 ∧ ((𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑡 ∈ 𝐵 ∧ 𝑢 ∈ 𝐵))) → ((𝑟𝑅𝑠 ∧ 𝑡𝑆𝑢) → (𝑟 + 𝑡)𝑇(𝑠 + 𝑢)))
eropr.12	⊢ ⨣ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)}
eropr.13	⊢ (𝜑 → 𝑅 ∈ 𝑋)
eropr.14	⊢ (𝜑 → 𝑆 ∈ 𝑌)
eropr.15	⊢ 𝐿 = (𝐶 / 𝑇)

Assertion

Ref	Expression
eroprf	⊢ (𝜑 → ⨣ :(𝐽 × 𝐾)⟶𝐿)

Distinct variable groups:   𝑞,𝑝,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧,𝐴   𝐵,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝐿,𝑝,𝑞,𝑥,𝑦,𝑧   𝐽,𝑝,𝑞,𝑥,𝑦,𝑧   𝑅,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝐾,𝑝,𝑞,𝑥,𝑦,𝑧   𝑆,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   + ,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝜑,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝑇,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝑋,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑧   𝑌,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑧

Allowed substitution hints:   𝐶(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   ⨣ (𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑈(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝐽(𝑢,𝑡,𝑠,𝑟)   𝐾(𝑢,𝑡,𝑠,𝑟)   𝐿(𝑢,𝑡,𝑠,𝑟)   𝑉(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑊(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑋(𝑥,𝑦)   𝑌(𝑥,𝑦)   𝑍(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)

Proof of Theorem eroprf

Step	Hyp	Ref	Expression
1		eropr.3	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑇 ∈ 𝑍)
2	1	ad2antrr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐵)) → 𝑇 ∈ 𝑍)
3		eropr.10	. . . . . . . . . . . . 13 ⊢ (𝜑 → + :(𝐴 × 𝐵)⟶𝐶)
4	3	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → + :(𝐴 × 𝐵)⟶𝐶)
5	4	fovrnda 5985	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐵)) → (𝑝 + 𝑞) ∈ 𝐶)
6		ecelqsg 6554	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ 𝑍 ∧ (𝑝 + 𝑞) ∈ 𝐶) → [(𝑝 + 𝑞)]𝑇 ∈ (𝐶 / 𝑇))
7	2, 5, 6	syl2anc 409	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐵)) → [(𝑝 + 𝑞)]𝑇 ∈ (𝐶 / 𝑇))
8		eropr.15	. . . . . . . . . 10 ⊢ 𝐿 = (𝐶 / 𝑇)
9	7, 8	eleqtrrdi 2260	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐵)) → [(𝑝 + 𝑞)]𝑇 ∈ 𝐿)
10		eleq1a 2238	. . . . . . . . 9 ⊢ ([(𝑝 + 𝑞)]𝑇 ∈ 𝐿 → (𝑧 = [(𝑝 + 𝑞)]𝑇 → 𝑧 ∈ 𝐿))
11	9, 10	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐵)) → (𝑧 = [(𝑝 + 𝑞)]𝑇 → 𝑧 ∈ 𝐿))
12	11	adantld 276	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐵)) → (((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → 𝑧 ∈ 𝐿))
13	12	rexlimdvva 2591	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → 𝑧 ∈ 𝐿))
14	13	abssdv 3216	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → {𝑧 ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)} ⊆ 𝐿)
15		eropr.1	. . . . . . 7 ⊢ 𝐽 = (𝐴 / 𝑅)
16		eropr.2	. . . . . . 7 ⊢ 𝐾 = (𝐵 / 𝑆)
17		eropr.4	. . . . . . 7 ⊢ (𝜑 → 𝑅 Er 𝑈)
18		eropr.5	. . . . . . 7 ⊢ (𝜑 → 𝑆 Er 𝑉)
19		eropr.6	. . . . . . 7 ⊢ (𝜑 → 𝑇 Er 𝑊)
20		eropr.7	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ 𝑈)
21		eropr.8	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝑉)
22		eropr.9	. . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ 𝑊)
23		eropr.11	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑡 ∈ 𝐵 ∧ 𝑢 ∈ 𝐵))) → ((𝑟𝑅𝑠 ∧ 𝑡𝑆𝑢) → (𝑟 + 𝑡)𝑇(𝑠 + 𝑢)))
24	15, 16, 1, 17, 18, 19, 20, 21, 22, 3, 23	eroveu 6592	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → ∃!𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
25		iotacl 5176	. . . . . 6 ⊢ (∃!𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ {𝑧 ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)})
26	24, 25	syl 14	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ {𝑧 ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)})
27	14, 26	sseldd 3143	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ 𝐿)
28	27	ralrimivva 2548	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐾 (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ 𝐿)
29		eqid 2165	. . . 4 ⊢ (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) = (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
30	29	fmpo 6169	. . 3 ⊢ (∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐾 (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ 𝐿 ↔ (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))):(𝐽 × 𝐾)⟶𝐿)
31	28, 30	sylib 121	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))):(𝐽 × 𝐾)⟶𝐿)
32		eropr.12	. . . 4 ⊢ ⨣ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)}
33	15, 16, 1, 17, 18, 19, 20, 21, 22, 3, 23, 32	erovlem 6593	. . 3 ⊢ (𝜑 → ⨣ = (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
34	33	feq1d 5324	. 2 ⊢ (𝜑 → ( ⨣ :(𝐽 × 𝐾)⟶𝐿 ↔ (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))):(𝐽 × 𝐾)⟶𝐿))
35	31, 34	mpbird 166	1 ⊢ (𝜑 → ⨣ :(𝐽 × 𝐾)⟶𝐿)

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1343  ∃!weu 2014   ∈ wcel 2136  {cab 2151  ∀wral 2444  ∃wrex 2445   ⊆ wss 3116   class class class wbr 3982   × cxp 4602  ℩cio 5151  ⟶wf 5184  (class class class)co 5842  {coprab 5843   ∈ cmpo 5844   Er wer 6498  [cec 6499   / cqs 6500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-er 6501  df-ec 6503  df-qs 6507

This theorem is referenced by:  eroprf2  6595