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

Theorem qusring2 14371
Description: The quotient structure of a ring is a ring. (Contributed by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
qusring2.u (𝜑𝑈 = (𝑅 /s ))
qusring2.v (𝜑𝑉 = (Base‘𝑅))
qusring2.p + = (+g𝑅)
qusring2.t · = (.r𝑅)
qusring2.o 1 = (1r𝑅)
qusring2.r (𝜑 Er 𝑉)
qusring2.e1 (𝜑 → ((𝑎 𝑝𝑏 𝑞) → (𝑎 + 𝑏) (𝑝 + 𝑞)))
qusring2.e2 (𝜑 → ((𝑎 𝑝𝑏 𝑞) → (𝑎 · 𝑏) (𝑝 · 𝑞)))
qusring2.x (𝜑𝑅 ∈ Ring)
Assertion
Ref Expression
qusring2 (𝜑 → (𝑈 ∈ Ring ∧ [ 1 ] = (1r𝑈)))
Distinct variable groups:   𝑞,𝑝, +   1 ,𝑝,𝑞   𝑎,𝑏,𝑝,𝑞,𝑈   𝑉,𝑎,𝑏,𝑝,𝑞   ,𝑎,𝑏,𝑝,𝑞   𝜑,𝑎,𝑏,𝑝,𝑞   · ,𝑝,𝑞   𝑅,𝑝,𝑞
Allowed substitution hints:   + (𝑎, 𝑏)   𝑅(𝑎, 𝑏)   · (𝑎, 𝑏)   1 (𝑎, 𝑏)

Proof of Theorem qusring2
Dummy variables 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 qusring2.u . . . 4 (𝜑𝑈 = (𝑅 /s ))
2 qusring2.v . . . 4 (𝜑𝑉 = (Base‘𝑅))
3 eqid 2238 . . . 4 (𝑢𝑉 ↦ [𝑢] ) = (𝑢𝑉 ↦ [𝑢] )
4 qusring2.r . . . . 5 (𝜑 Er 𝑉)
5 basfn 13411 . . . . . . 7 Base Fn V
6 qusring2.x . . . . . . . 8 (𝜑𝑅 ∈ Ring)
76elexd 2835 . . . . . . 7 (𝜑𝑅 ∈ V)
8 funfvex 5712 . . . . . . . 8 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
98funfni 5483 . . . . . . 7 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
105, 7, 9sylancr 418 . . . . . 6 (𝜑 → (Base‘𝑅) ∈ V)
112, 10eqeltrd 2315 . . . . 5 (𝜑𝑉 ∈ V)
12 erex 6831 . . . . 5 ( Er 𝑉 → (𝑉 ∈ V → ∈ V))
134, 11, 12sylc 62 . . . 4 (𝜑 ∈ V)
141, 2, 3, 13, 6qusval 13644 . . 3 (𝜑𝑈 = ((𝑢𝑉 ↦ [𝑢] ) “s 𝑅))
15 qusring2.p . . 3 + = (+g𝑅)
16 qusring2.t . . 3 · = (.r𝑅)
17 qusring2.o . . 3 1 = (1r𝑅)
181, 2, 3, 13, 6quslem 13645 . . 3 (𝜑 → (𝑢𝑉 ↦ [𝑢] ):𝑉onto→(𝑉 / ))
196adantr 276 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → 𝑅 ∈ Ring)
20 simprl 535 . . . . . . 7 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → 𝑥𝑉)
212adantr 276 . . . . . . 7 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → 𝑉 = (Base‘𝑅))
2220, 21eleqtrd 2317 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → 𝑥 ∈ (Base‘𝑅))
23 simprr 537 . . . . . . 7 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → 𝑦𝑉)
2423, 21eleqtrd 2317 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → 𝑦 ∈ (Base‘𝑅))
25 eqid 2238 . . . . . . 7 (Base‘𝑅) = (Base‘𝑅)
2625, 15ringacl 14335 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
2719, 22, 24, 26syl3anc 1278 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
2827, 21eleqtrrd 2318 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
29 qusring2.e1 . . . 4 (𝜑 → ((𝑎 𝑝𝑏 𝑞) → (𝑎 + 𝑏) (𝑝 + 𝑞)))
304, 11, 3, 28, 29ercpbl 13652 . . 3 ((𝜑 ∧ (𝑎𝑉𝑏𝑉) ∧ (𝑝𝑉𝑞𝑉)) → ((((𝑢𝑉 ↦ [𝑢] )‘𝑎) = ((𝑢𝑉 ↦ [𝑢] )‘𝑝) ∧ ((𝑢𝑉 ↦ [𝑢] )‘𝑏) = ((𝑢𝑉 ↦ [𝑢] )‘𝑞)) → ((𝑢𝑉 ↦ [𝑢] )‘(𝑎 + 𝑏)) = ((𝑢𝑉 ↦ [𝑢] )‘(𝑝 + 𝑞))))
3125, 16ringcl 14317 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥 · 𝑦) ∈ (Base‘𝑅))
3219, 22, 24, 31syl3anc 1278 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → (𝑥 · 𝑦) ∈ (Base‘𝑅))
3332, 21eleqtrrd 2318 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → (𝑥 · 𝑦) ∈ 𝑉)
34 qusring2.e2 . . . 4 (𝜑 → ((𝑎 𝑝𝑏 𝑞) → (𝑎 · 𝑏) (𝑝 · 𝑞)))
354, 11, 3, 33, 34ercpbl 13652 . . 3 ((𝜑 ∧ (𝑎𝑉𝑏𝑉) ∧ (𝑝𝑉𝑞𝑉)) → ((((𝑢𝑉 ↦ [𝑢] )‘𝑎) = ((𝑢𝑉 ↦ [𝑢] )‘𝑝) ∧ ((𝑢𝑉 ↦ [𝑢] )‘𝑏) = ((𝑢𝑉 ↦ [𝑢] )‘𝑞)) → ((𝑢𝑉 ↦ [𝑢] )‘(𝑎 · 𝑏)) = ((𝑢𝑉 ↦ [𝑢] )‘(𝑝 · 𝑞))))
3614, 2, 15, 16, 17, 18, 30, 35, 6imasring 14369 . 2 (𝜑 → (𝑈 ∈ Ring ∧ ((𝑢𝑉 ↦ [𝑢] )‘ 1 ) = (1r𝑈)))
37 ringsrg 14352 . . . . . . . 8 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
3825, 17srgidcl 14280 . . . . . . . 8 (𝑅 ∈ SRing → 1 ∈ (Base‘𝑅))
396, 37, 383syl 17 . . . . . . 7 (𝜑1 ∈ (Base‘𝑅))
4039, 2eleqtrrd 2318 . . . . . 6 (𝜑1𝑉)
414, 11, 3, 40divsfvalg 13650 . . . . 5 (𝜑 → ((𝑢𝑉 ↦ [𝑢] )‘ 1 ) = [ 1 ] )
4241eqcomd 2244 . . . 4 (𝜑 → [ 1 ] = ((𝑢𝑉 ↦ [𝑢] )‘ 1 ))
4342eqeq1d 2247 . . 3 (𝜑 → ([ 1 ] = (1r𝑈) ↔ ((𝑢𝑉 ↦ [𝑢] )‘ 1 ) = (1r𝑈)))
4443anbi2d 468 . 2 (𝜑 → ((𝑈 ∈ Ring ∧ [ 1 ] = (1r𝑈)) ↔ (𝑈 ∈ Ring ∧ ((𝑢𝑉 ↦ [𝑢] )‘ 1 ) = (1r𝑈))))
4536, 44mpbird 167 1 (𝜑 → (𝑈 ∈ Ring ∧ [ 1 ] = (1r𝑈)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  Vcvv 2821   class class class wbr 4130  cmpt 4192   Fn wfn 5372  cfv 5377  (class class class)co 6085   Er wer 6804  [cec 6805   / cqs 6806  Basecbs 13352  +gcplusg 13431  .rcmulr 13432   /s cqus 13623  1rcur 14262  SRingcsrg 14267  Ringcrg 14300
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-er 6807  df-ec 6809  df-qs 6813  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-0g 13612  df-iimas 13624  df-qus 13625  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-cmn 14089  df-abl 14090  df-mgp 14218  df-ur 14263  df-srg 14268  df-ring 14302
This theorem is used by:  qus1  14863
  Copyright terms: Public domain W3C validator