Theorem idlsubcl 33822

Description: An ideal is closed under subtraction. (Contributed by Jeff Madsen, 19-Jun-2010.)

Hypotheses

Ref	Expression
idlsubcl.1	|- G = ( 1st ` R )
idlsubcl.2	|- D = ( /g ` G )

Assertion

Ref	Expression
idlsubcl	|- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> ( A D B ) e. I )

Proof of Theorem idlsubcl

Step	Hyp	Ref	Expression
1		idlsubcl.1	. . . . 5 |- G = ( 1st ` R )
2		eqid 2622	. . . . 5 |- ran G = ran G
3	1, 2	idlcl 33816	. . . 4 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ A e. I ) -> A e. ran G )
4	1, 2	idlcl 33816	. . . 4 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ B e. I ) -> B e. ran G )
5	3, 4	anim12da 33506	. . 3 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> ( A e. ran G /\ B e. ran G ) )
6		eqid 2622	. . . . . 6 |- ( inv ` G ) = ( inv ` G )
7		idlsubcl.2	. . . . . 6 |- D = ( /g ` G )
8	1, 2, 6, 7	rngosub 33729	. . . . 5 |- ( ( R e. RingOps /\ A e. ran G /\ B e. ran G ) -> ( A D B ) = ( A G ( ( inv ` G ) ` B ) ) )
9	8	3expb 1266	. . . 4 |- ( ( R e. RingOps /\ ( A e. ran G /\ B e. ran G ) ) -> ( A D B ) = ( A G ( ( inv ` G ) ` B ) ) )
10	9	adantlr 751	. . 3 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. ran G /\ B e. ran G ) ) -> ( A D B ) = ( A G ( ( inv ` G ) ` B ) ) )
11	5, 10	syldan 487	. 2 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> ( A D B ) = ( A G ( ( inv ` G ) ` B ) ) )
12		simprl 794	. . . 4 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> A e. I )
13	1, 6	idlnegcl 33821	. . . . 5 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ B e. I ) -> ( ( inv ` G ) ` B ) e. I )
14	13	adantrl 752	. . . 4 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> ( ( inv ` G ) ` B ) e. I )
15	12, 14	jca 554	. . 3 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> ( A e. I /\ ( ( inv ` G ) ` B ) e. I ) )
16	1	idladdcl 33818	. . 3 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ ( ( inv ` G ) ` B ) e. I ) ) -> ( A G ( ( inv ` G ) ` B ) ) e. I )
17	15, 16	syldan 487	. 2 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> ( A G ( ( inv ` G ) ` B ) ) e. I )
18	11, 17	eqeltrd 2701	1 |- ( ( ( R e. RingOps /\ I e. ( Idl ` R ) ) /\ ( A e. I /\ B e. I ) ) -> ( A D B ) e. I )

Syntax hints:   -> wi 4   /\ wa 384   = wceq 1483   e. wcel 1990   ran crn 5115   ` cfv 5888  (class class class)co 6650   1stc1st 7166   invcgn 27345   /g cgs 27346   RingOpscrngo 33693   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-rep 4771  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-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  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-iun 4522  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-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-grpo 27347  df-gid 27348  df-ginv 27349  df-gdiv 27350  df-ablo 27399  df-ass 33642  df-exid 33644  df-mgmOLD 33648  df-sgrOLD 33660  df-mndo 33666  df-rngo 33694  df-idl 33809

This theorem is referenced by: (None)