Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isidlc Structured version   Visualization version   GIF version

Theorem isidlc 34122
Description: The predicate "is an ideal of the commutative ring 𝑅." (Contributed by Jeff Madsen, 10-Jun-2010.)
Hypotheses
Ref Expression
idlval.1 𝐺 = (1st𝑅)
idlval.2 𝐻 = (2nd𝑅)
idlval.3 𝑋 = ran 𝐺
idlval.4 𝑍 = (GId‘𝐺)
Assertion
Ref Expression
isidlc (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
Distinct variable groups:   𝑥,𝑅,𝑦,𝑧   𝑧,𝑋   𝑥,𝐼,𝑦,𝑧   𝑥,𝑋
Allowed substitution hints:   𝐺(𝑥,𝑦,𝑧)   𝐻(𝑥,𝑦,𝑧)   𝑋(𝑦)   𝑍(𝑥,𝑦,𝑧)

Proof of Theorem isidlc
StepHypRef Expression
1 crngorngo 34107 . . 3 (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
2 idlval.1 . . . 4 𝐺 = (1st𝑅)
3 idlval.2 . . . 4 𝐻 = (2nd𝑅)
4 idlval.3 . . . 4 𝑋 = ran 𝐺
5 idlval.4 . . . 4 𝑍 = (GId‘𝐺)
62, 3, 4, 5isidl 34121 . . 3 (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
71, 6syl 17 . 2 (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
8 ssel2 3790 . . . . . . . 8 ((𝐼𝑋𝑥𝐼) → 𝑥𝑋)
92, 3, 4crngocom 34108 . . . . . . . . . . . . . . 15 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋𝑧𝑋) → (𝑥𝐻𝑧) = (𝑧𝐻𝑥))
109eleq1d 2869 . . . . . . . . . . . . . 14 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋𝑧𝑋) → ((𝑥𝐻𝑧) ∈ 𝐼 ↔ (𝑧𝐻𝑥) ∈ 𝐼))
1110biimprd 239 . . . . . . . . . . . . 13 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋𝑧𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
12113expa 1140 . . . . . . . . . . . 12 (((𝑅 ∈ CRingOps ∧ 𝑥𝑋) ∧ 𝑧𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
1312pm4.71d 553 . . . . . . . . . . 11 (((𝑅 ∈ CRingOps ∧ 𝑥𝑋) ∧ 𝑧𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 ↔ ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))
1413bicomd 214 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑥𝑋) ∧ 𝑧𝑋) → (((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ (𝑧𝐻𝑥) ∈ 𝐼))
1514ralbidva 3172 . . . . . . . . 9 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋) → (∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))
1615anbi2d 616 . . . . . . . 8 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋) → ((∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
178, 16sylan2 582 . . . . . . 7 ((𝑅 ∈ CRingOps ∧ (𝐼𝑋𝑥𝐼)) → ((∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
1817anassrs 455 . . . . . 6 (((𝑅 ∈ CRingOps ∧ 𝐼𝑋) ∧ 𝑥𝐼) → ((∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
1918ralbidva 3172 . . . . 5 ((𝑅 ∈ CRingOps ∧ 𝐼𝑋) → (∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
2019adantrr 699 . . . 4 ((𝑅 ∈ CRingOps ∧ (𝐼𝑋𝑍𝐼)) → (∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
2120pm5.32da 570 . . 3 (𝑅 ∈ CRingOps → (((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
22 df-3an 1102 . . 3 ((𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))))
23 df-3an 1102 . . 3 ((𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)) ↔ ((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
2421, 22, 233bitr4g 305 . 2 (𝑅 ∈ CRingOps → ((𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
257, 24bitrd 270 1 (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 384  w3a 1100   = wceq 1637  wcel 2158  wral 3095  wss 3766  ran crn 5309  cfv 6098  (class class class)co 6871  1st c1st 7393  2nd c2nd 7394  GIdcgi 27669  RingOpscrngo 34001  CRingOpsccring 34100  Idlcidl 34114
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1880  ax-4 1897  ax-5 2004  ax-6 2070  ax-7 2106  ax-8 2160  ax-9 2167  ax-10 2187  ax-11 2203  ax-12 2216  ax-13 2422  ax-ext 2784  ax-sep 4971  ax-nul 4980  ax-pow 5032  ax-pr 5093  ax-un 7176
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1865  df-sb 2063  df-eu 2636  df-mo 2637  df-clab 2792  df-cleq 2798  df-clel 2801  df-nfc 2936  df-ral 3100  df-rex 3101  df-rab 3104  df-v 3392  df-sbc 3631  df-dif 3769  df-un 3771  df-in 3773  df-ss 3780  df-nul 4114  df-if 4277  df-pw 4350  df-sn 4368  df-pr 4370  df-op 4374  df-uni 4627  df-br 4841  df-opab 4903  df-mpt 4920  df-id 5216  df-xp 5314  df-rel 5315  df-cnv 5316  df-co 5317  df-dm 5318  df-rn 5319  df-iota 6061  df-fun 6100  df-fv 6106  df-ov 6874  df-1st 7395  df-2nd 7396  df-rngo 34002  df-com2 34097  df-crngo 34101  df-idl 34117
This theorem is referenced by:  prnc  34174
  Copyright terms: Public domain W3C validator