Theorem 2idlval 21574

Description: Definition of a two-sided ideal. (Contributed by Mario Carneiro, 14-Jun-2015.)

Hypotheses

Ref	Expression
2idlval.i	⊢ 𝐼 = (LIdeal‘𝑅)
2idlval.o	⊢ 𝑂 = (oppr‘𝑅)
2idlval.j	⊢ 𝐽 = (LIdeal‘𝑂)
2idlval.t	⊢ 𝑇 = (2Ideal‘𝑅)

Assertion

Ref	Expression
2idlval	⊢ 𝑇 = (𝐼 ∩ 𝐽)

Proof of Theorem 2idlval

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2idlval.t	. 2 ⊢ 𝑇 = (2Ideal‘𝑅)
2		fveq2 6908	. . . . . 6 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅))
3		2idlval.i	. . . . . 6 ⊢ 𝐼 = (LIdeal‘𝑅)
4	2, 3	eqtr4di 2816	. . . . 5 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = 𝐼)
5		fveq2 6908	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = (oppr‘𝑅))
6		2idlval.o	. . . . . . . 8 ⊢ 𝑂 = (oppr‘𝑅)
7	5, 6	eqtr4di 2816	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = 𝑂)
8	7	fveq2d 6912	. . . . . 6 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = (LIdeal‘𝑂))
9		2idlval.j	. . . . . 6 ⊢ 𝐽 = (LIdeal‘𝑂)
10	8, 9	eqtr4di 2816	. . . . 5 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = 𝐽)
11	4, 10	ineq12d 4121	. . . 4 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟))) = (𝐼 ∩ 𝐽))
12		df-2idl 21573	. . . 4 ⊢ 2Ideal = (𝑟 ∈ V ↦ ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟))))
13	3	fvexi 6922	. . . . 5 ⊢ 𝐼 ∈ V
14	13	inex1 5281	. . . 4 ⊢ (𝐼 ∩ 𝐽) ∈ V
15	11, 12, 14	fvmpt 7016	. . 3 ⊢ (𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽))
16		fvprc 6900	. . . 4 ⊢ (¬ 𝑅 ∈ V → (2Ideal‘𝑅) = ∅)
17		inss1 4136	. . . . 5 ⊢ (𝐼 ∩ 𝐽) ⊆ 𝐼
18		fvprc 6900	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → (LIdeal‘𝑅) = ∅)
19	3, 18	eqtrid 2810	. . . . 5 ⊢ (¬ 𝑅 ∈ V → 𝐼 = ∅)
20		sseq0 4357	. . . . 5 ⊢ (((𝐼 ∩ 𝐽) ⊆ 𝐼 ∧ 𝐼 = ∅) → (𝐼 ∩ 𝐽) = ∅)
21	17, 19, 20	sylancr 599	. . . 4 ⊢ (¬ 𝑅 ∈ V → (𝐼 ∩ 𝐽) = ∅)
22	16, 21	eqtr4d 2801	. . 3 ⊢ (¬ 𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽))
23	15, 22	pm2.61i 184	. 2 ⊢ (2Ideal‘𝑅) = (𝐼 ∩ 𝐽)
24	1, 23	eqtri 2786	1 ⊢ 𝑇 = (𝐼 ∩ 𝐽)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ‘cfv 6558  opp_rcoppr 20596  LIdealclidl 21514  2Idealc2idl 21572

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-2idl 21573

This theorem is used by:  2idlelb  21576  2idllidld  21577  2idlridld  21578  2idl0  21584  2idl1  21585  qus1  21598  qusrhm  21600  crng2idl  21606  oppr2idl  34080  qsdrngilem  34088  qsdrngi  34089