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

Theorem crngunit 14391
Description: Property of being a unit in a commutative ring. (Contributed by Mario Carneiro, 18-Apr-2016.)
Hypotheses
Ref Expression
crngunit.1 𝑈 = (Unit‘𝑅)
crngunit.2 1 = (1r𝑅)
crngunit.3 = (∥r𝑅)
Assertion
Ref Expression
crngunit (𝑅 ∈ CRing → (𝑋𝑈𝑋 1 ))

Proof of Theorem crngunit
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 crngunit.1 . . . . 5 𝑈 = (Unit‘𝑅)
21a1i 9 . . . 4 (𝑅 ∈ CRing → 𝑈 = (Unit‘𝑅))
3 crngunit.2 . . . . 5 1 = (1r𝑅)
43a1i 9 . . . 4 (𝑅 ∈ CRing → 1 = (1r𝑅))
5 crngunit.3 . . . . 5 = (∥r𝑅)
65a1i 9 . . . 4 (𝑅 ∈ CRing → = (∥r𝑅))
7 eqidd 2239 . . . 4 (𝑅 ∈ CRing → (oppr𝑅) = (oppr𝑅))
8 eqidd 2239 . . . 4 (𝑅 ∈ CRing → (∥r‘(oppr𝑅)) = (∥r‘(oppr𝑅)))
9 crngring 14286 . . . . 5 (𝑅 ∈ CRing → 𝑅 ∈ Ring)
10 ringsrg 14325 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
119, 10syl 14 . . . 4 (𝑅 ∈ CRing → 𝑅 ∈ SRing)
122, 4, 6, 7, 8, 11isunitd 14386 . . 3 (𝑅 ∈ CRing → (𝑋𝑈 ↔ (𝑋 1𝑋(∥r‘(oppr𝑅)) 1 )))
13 eqid 2238 . . . . . . . . . . . 12 (Base‘𝑅) = (Base‘𝑅)
14 eqid 2238 . . . . . . . . . . . 12 (.r𝑅) = (.r𝑅)
15 eqid 2238 . . . . . . . . . . . 12 (oppr𝑅) = (oppr𝑅)
16 eqid 2238 . . . . . . . . . . . 12 (.r‘(oppr𝑅)) = (.r‘(oppr𝑅))
1713, 14, 15, 16crngoppr 14350 . . . . . . . . . . 11 ((𝑅 ∈ CRing ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑦(.r𝑅)𝑋) = (𝑦(.r‘(oppr𝑅))𝑋))
18173expa 1234 . . . . . . . . . 10 (((𝑅 ∈ CRing ∧ 𝑦 ∈ (Base‘𝑅)) ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑦(.r𝑅)𝑋) = (𝑦(.r‘(oppr𝑅))𝑋))
1918eqcomd 2244 . . . . . . . . 9 (((𝑅 ∈ CRing ∧ 𝑦 ∈ (Base‘𝑅)) ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑦(.r‘(oppr𝑅))𝑋) = (𝑦(.r𝑅)𝑋))
2019an32s 574 . . . . . . . 8 (((𝑅 ∈ CRing ∧ 𝑋 ∈ (Base‘𝑅)) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑦(.r‘(oppr𝑅))𝑋) = (𝑦(.r𝑅)𝑋))
2120eqeq1d 2247 . . . . . . 7 (((𝑅 ∈ CRing ∧ 𝑋 ∈ (Base‘𝑅)) ∧ 𝑦 ∈ (Base‘𝑅)) → ((𝑦(.r‘(oppr𝑅))𝑋) = 1 ↔ (𝑦(.r𝑅)𝑋) = 1 ))
2221rexbidva 2547 . . . . . 6 ((𝑅 ∈ CRing ∧ 𝑋 ∈ (Base‘𝑅)) → (∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘(oppr𝑅))𝑋) = 1 ↔ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r𝑅)𝑋) = 1 ))
2322pm5.32da 456 . . . . 5 (𝑅 ∈ CRing → ((𝑋 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘(oppr𝑅))𝑋) = 1 ) ↔ (𝑋 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r𝑅)𝑋) = 1 )))
2415, 13opprbasg 14353 . . . . . 6 (𝑅 ∈ CRing → (Base‘𝑅) = (Base‘(oppr𝑅)))
2515opprring 14357 . . . . . . 7 (𝑅 ∈ Ring → (oppr𝑅) ∈ Ring)
26 ringsrg 14325 . . . . . . 7 ((oppr𝑅) ∈ Ring → (oppr𝑅) ∈ SRing)
279, 25, 263syl 17 . . . . . 6 (𝑅 ∈ CRing → (oppr𝑅) ∈ SRing)
28 eqidd 2239 . . . . . 6 (𝑅 ∈ CRing → (.r‘(oppr𝑅)) = (.r‘(oppr𝑅)))
2924, 8, 27, 28dvdsrd 14374 . . . . 5 (𝑅 ∈ CRing → (𝑋(∥r‘(oppr𝑅)) 1 ↔ (𝑋 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘(oppr𝑅))𝑋) = 1 )))
30 eqidd 2239 . . . . . 6 (𝑅 ∈ CRing → (Base‘𝑅) = (Base‘𝑅))
31 eqidd 2239 . . . . . 6 (𝑅 ∈ CRing → (.r𝑅) = (.r𝑅))
3230, 6, 11, 31dvdsrd 14374 . . . . 5 (𝑅 ∈ CRing → (𝑋 1 ↔ (𝑋 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r𝑅)𝑋) = 1 )))
3323, 29, 323bitr4d 220 . . . 4 (𝑅 ∈ CRing → (𝑋(∥r‘(oppr𝑅)) 1𝑋 1 ))
3433anbi2d 468 . . 3 (𝑅 ∈ CRing → ((𝑋 1𝑋(∥r‘(oppr𝑅)) 1 ) ↔ (𝑋 1𝑋 1 )))
3512, 34bitrd 188 . 2 (𝑅 ∈ CRing → (𝑋𝑈 ↔ (𝑋 1𝑋 1 )))
36 pm4.24 399 . 2 (𝑋 1 ↔ (𝑋 1𝑋 1 ))
3735, 36bitr4di 198 1 (𝑅 ∈ CRing → (𝑋𝑈𝑋 1 ))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  wrex 2529   class class class wbr 4125  cfv 5372  (class class class)co 6075  Basecbs 13330  .rcmulr 13409  1rcur 14237  SRingcsrg 14241  Ringcrg 14274  CRingccrg 14275  opprcoppr 14345  rcdsr 14365  Unitcui 14366
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-tpos 6506  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-plusg 13421  df-mulr 13422  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786  df-cmn 14066  df-abl 14067  df-mgp 14195  df-ur 14238  df-srg 14242  df-ring 14276  df-cring 14277  df-oppr 14346  df-dvdsr 14368  df-unit 14369
This theorem is referenced by:  dvdsunit  14392  cnfldui  14896  znunit  14966
  Copyright terms: Public domain W3C validator