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 33814
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 33799 . . 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 33813 . . 3 (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
71, 6syl 17 . 2 (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
8 ssel2 3598 . . . . . . . 8 ((𝐼𝑋𝑥𝐼) → 𝑥𝑋)
92, 3, 4crngocom 33800 . . . . . . . . . . . . . . 15 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋𝑧𝑋) → (𝑥𝐻𝑧) = (𝑧𝐻𝑥))
109eleq1d 2686 . . . . . . . . . . . . . 14 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋𝑧𝑋) → ((𝑥𝐻𝑧) ∈ 𝐼 ↔ (𝑧𝐻𝑥) ∈ 𝐼))
1110biimprd 238 . . . . . . . . . . . . 13 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋𝑧𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
12113expa 1265 . . . . . . . . . . . 12 (((𝑅 ∈ CRingOps ∧ 𝑥𝑋) ∧ 𝑧𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
1312pm4.71d 666 . . . . . . . . . . 11 (((𝑅 ∈ CRingOps ∧ 𝑥𝑋) ∧ 𝑧𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 ↔ ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))
1413bicomd 213 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑥𝑋) ∧ 𝑧𝑋) → (((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ (𝑧𝐻𝑥) ∈ 𝐼))
1514ralbidva 2985 . . . . . . . . 9 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋) → (∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))
1615anbi2d 740 . . . . . . . 8 ((𝑅 ∈ CRingOps ∧ 𝑥𝑋) → ((∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
178, 16sylan2 491 . . . . . . 7 ((𝑅 ∈ CRingOps ∧ (𝐼𝑋𝑥𝐼)) → ((∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
1817anassrs 680 . . . . . 6 (((𝑅 ∈ CRingOps ∧ 𝐼𝑋) ∧ 𝑥𝐼) → ((∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
1918ralbidva 2985 . . . . 5 ((𝑅 ∈ CRingOps ∧ 𝐼𝑋) → (∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
2019adantrr 753 . . . 4 ((𝑅 ∈ CRingOps ∧ (𝐼𝑋𝑍𝐼)) → (∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
2120pm5.32da 673 . . 3 (𝑅 ∈ CRingOps → (((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
22 df-3an 1039 . . 3 ((𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))))
23 df-3an 1039 . . 3 ((𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)) ↔ ((𝐼𝑋𝑍𝐼) ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
2421, 22, 233bitr4g 303 . 2 (𝑅 ∈ CRingOps → ((𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
257, 24bitrd 268 1 (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼𝑋𝑍𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wcel 1990  wral 2912  wss 3574  ran crn 5115  cfv 5888  (class class class)co 6650  1st c1st 7166  2nd c2nd 7167  GIdcgi 27344  RingOpscrngo 33693  CRingOpsccring 33792  Idlcidl 33806
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-1st 7168  df-2nd 7169  df-rngo 33694  df-com2 33789  df-crngo 33793  df-idl 33809
This theorem is referenced by:  prnc  33866
  Copyright terms: Public domain W3C validator