Theorem idlrmulcl 38084

Description: An ideal is closed under multiplication on the right. (Contributed by Jeff Madsen, 10-Jun-2010.)

Hypotheses

Ref	Expression
idllmulcl.1	⊢ 𝐺 = (1st ‘𝑅)
idllmulcl.2	⊢ 𝐻 = (2nd ‘𝑅)
idllmulcl.3	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
idlrmulcl	⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝐴 ∈ 𝐼 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐻𝐵) ∈ 𝐼)

Proof of Theorem idlrmulcl

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		idllmulcl.1	. . . . . 6 ⊢ 𝐺 = (1st ‘𝑅)
2		idllmulcl.2	. . . . . 6 ⊢ 𝐻 = (2nd ‘𝑅)
3		idllmulcl.3	. . . . . 6 ⊢ 𝑋 = ran 𝐺
4		eqid 2733	. . . . . 6 ⊢ (GId‘𝐺) = (GId‘𝐺)
5	1, 2, 3, 4	isidl 38077	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ (GId‘𝐺) ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
6	5	biimpa 476	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝐼 ⊆ 𝑋 ∧ (GId‘𝐺) ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))))
7	6	simp3d 1144	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))
8		simpr 484	. . . . . 6 ⊢ (((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) → (𝑥𝐻𝑧) ∈ 𝐼)
9	8	ralimi 3070	. . . . 5 ⊢ (∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) → ∀𝑧 ∈ 𝑋 (𝑥𝐻𝑧) ∈ 𝐼)
10	9	adantl 481	. . . 4 ⊢ ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) → ∀𝑧 ∈ 𝑋 (𝑥𝐻𝑧) ∈ 𝐼)
11	10	ralimi 3070	. . 3 ⊢ (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) → ∀𝑥 ∈ 𝐼 ∀𝑧 ∈ 𝑋 (𝑥𝐻𝑧) ∈ 𝐼)
12	7, 11	syl 17	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → ∀𝑥 ∈ 𝐼 ∀𝑧 ∈ 𝑋 (𝑥𝐻𝑧) ∈ 𝐼)
13		oveq1 7361	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐻𝑧) = (𝐴𝐻𝑧))
14	13	eleq1d 2818	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝐻𝑧) ∈ 𝐼 ↔ (𝐴𝐻𝑧) ∈ 𝐼))
15		oveq2 7362	. . . 4 ⊢ (𝑧 = 𝐵 → (𝐴𝐻𝑧) = (𝐴𝐻𝐵))
16	15	eleq1d 2818	. . 3 ⊢ (𝑧 = 𝐵 → ((𝐴𝐻𝑧) ∈ 𝐼 ↔ (𝐴𝐻𝐵) ∈ 𝐼))
17	14, 16	rspc2v 3584	. 2 ⊢ ((𝐴 ∈ 𝐼 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝐼 ∀𝑧 ∈ 𝑋 (𝑥𝐻𝑧) ∈ 𝐼 → (𝐴𝐻𝐵) ∈ 𝐼))
18	12, 17	mpan9 506	1 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝐴 ∈ 𝐼 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐻𝐵) ∈ 𝐼)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3048   ⊆ wss 3898  ran crn 5622  ‘cfv 6488  (class class class)co 7354  1^st c1st 7927  2^nd c2nd 7928  GIdcgi 30474  RingOpscrngo 37957  Idlcidl 38070

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7676

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-iota 6444  df-fun 6490  df-fv 6496  df-ov 7357  df-idl 38073

This theorem is referenced by:  1idl  38089  intidl  38092  unichnidl  38094