idlss - Mathbox for Jeff Madsen

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

Theorem idlss 38700

Description: Obsolete theorem, use 2idlss 21430 instead. An ideal of 𝑅 is a subset of 𝑅. (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
idlss.1	⊢ 𝐺 = (1^st ‘𝑅)
idlss.2	⊢ 𝑋 = ran 𝐺

**Assertion**
Ref	Expression
idlss	⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → 𝐼 ⊆ 𝑋)

Proof of Theorem idlss Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		idlss.1	. . . 4 ⊢ 𝐺 = (1^st ‘𝑅)
2		eqid 2765	. . . 4 ⊢ (2^nd ‘𝑅) = (2^nd ‘𝑅)
3		idlss.2	. . . 4 ⊢ 𝑋 = ran 𝐺
4		eqid 2765	. . . 4 ⊢ (GId‘𝐺) = (GId‘𝐺)
5	1, 2, 3, 4	isidl 38698	. . 3 ⊢ (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ (GId‘𝐺) ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧(2^nd ‘𝑅)𝑥) ∈ 𝐼 ∧ (𝑥(2^nd ‘𝑅)𝑧) ∈ 𝐼)))))
6	5	biimpa 482	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝐼 ⊆ 𝑋 ∧ (GId‘𝐺) ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧(2^nd ‘𝑅)𝑥) ∈ 𝐼 ∧ (𝑥(2^nd ‘𝑅)𝑧) ∈ 𝐼))))
7	6	simp1d 1160	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → 𝐼 ⊆ 𝑋)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ⊆ wss 3906 ran crn 5664 ‘cfv 6540 (class class class)co 7416 1^st c1st 7986 2^nd c2nd 7987 GIdcgi 30871 RingOpscrngo 38578 Idlcidl 38691

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7419 df-idl 38694

This theorem is used by: idlcl 38701 idlnegcl 38706 1idl 38710 divrngidl 38712 intidl 38713 unichnidl 38715 ispridl2 38722 igenmin 38748 igenidl2 38749

W3C validator