frlmsplit2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > frlmsplit2		Structured version Visualization version GIF version

Theorem frlmsplit2 21825

Description: Restriction is homomorphic on free modules. (Contributed by Stefan O'Rear, 3-Feb-2015.) (Proof shortened by AV, 21-Jul-2019.)

**Hypotheses**
Ref	Expression
frlmsplit2.y	⊢ 𝑌 = (𝑅 freeLMod 𝑈)
frlmsplit2.z	⊢ 𝑍 = (𝑅 freeLMod 𝑉)
frlmsplit2.b	⊢ 𝐵 = (Base‘𝑌)
frlmsplit2.c	⊢ 𝐶 = (Base‘𝑍)
frlmsplit2.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉))

**Assertion**
Ref	Expression
frlmsplit2	⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝐹 ∈ (𝑌 LMHom 𝑍))

Distinct variable groups: 𝑥,𝑌 𝑥,𝑅 𝑥,𝑈 𝑥,𝑍 𝑥,𝑉 𝑥,𝐵 𝑥,𝐶 𝑥,𝑋 Allowed substitution hint: 𝐹(𝑥)

**Proof of Theorem frlmsplit2**
Step	Hyp	Ref	Expression
1		simp1 1149	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝑅 ∈ Ring)
2		simp2 1150	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝑈 ∈ 𝑋)
3		frlmsplit2.y	. . . . . . 7 ⊢ 𝑌 = (𝑅 freeLMod 𝑈)
4		frlmsplit2.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑌)
5		eqid 2762	. . . . . . 7 ⊢ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑈)) = (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑈))
6	3, 4, 5	frlmlss 21803	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋) → 𝐵 ∈ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑈)))
7	1, 2, 6	syl2anc 593	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝐵 ∈ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑈)))
8		eqid 2762	. . . . . 6 ⊢ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) = (Base‘((ringLMod‘𝑅) ↑_s 𝑈))
9	8, 5	lssss 21003	. . . . 5 ⊢ (𝐵 ∈ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑈)) → 𝐵 ⊆ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)))
10		resmpt 6026	. . . . 5 ⊢ (𝐵 ⊆ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) → ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)))
11	7, 9, 10	3syl 18	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)))
12		frlmsplit2.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉))
13	11, 12	eqtr4di 2815	. . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) = 𝐹)
14		rlmlmod 21270	. . . . . 6 ⊢ (𝑅 ∈ Ring → (ringLMod‘𝑅) ∈ LMod)
15		eqid 2762	. . . . . . 7 ⊢ ((ringLMod‘𝑅) ↑_s 𝑈) = ((ringLMod‘𝑅) ↑_s 𝑈)
16		eqid 2762	. . . . . . 7 ⊢ ((ringLMod‘𝑅) ↑_s 𝑉) = ((ringLMod‘𝑅) ↑_s 𝑉)
17		eqid 2762	. . . . . . 7 ⊢ (Base‘((ringLMod‘𝑅) ↑_s 𝑉)) = (Base‘((ringLMod‘𝑅) ↑_s 𝑉))
18		eqid 2762	. . . . . . 7 ⊢ (𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) = (𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉))
19	15, 16, 8, 17, 18	pwssplit3 21128	. . . . . 6 ⊢ (((ringLMod‘𝑅) ∈ LMod ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → (𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ∈ (((ringLMod‘𝑅) ↑_s 𝑈) LMHom ((ringLMod‘𝑅) ↑_s 𝑉)))
20	14, 19	syl3an1 1176	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → (𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ∈ (((ringLMod‘𝑅) ↑_s 𝑈) LMHom ((ringLMod‘𝑅) ↑_s 𝑉)))
21		eqid 2762	. . . . . 6 ⊢ (((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) = (((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵)
22	5, 21	reslmhm 21119	. . . . 5 ⊢ (((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ∈ (((ringLMod‘𝑅) ↑_s 𝑈) LMHom ((ringLMod‘𝑅) ↑_s 𝑉)) ∧ 𝐵 ∈ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑈))) → ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom ((ringLMod‘𝑅) ↑_s 𝑉)))
23	20, 7, 22	syl2anc 593	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom ((ringLMod‘𝑅) ↑_s 𝑉)))
24	14	3ad2ant1 1146	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → (ringLMod‘𝑅) ∈ LMod)
25		simp3 1151	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝑉 ⊆ 𝑈)
26	2, 25	ssexd 5280	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝑉 ∈ V)
27	16	pwslmod 21037	. . . . . 6 ⊢ (((ringLMod‘𝑅) ∈ LMod ∧ 𝑉 ∈ V) → ((ringLMod‘𝑅) ↑_s 𝑉) ∈ LMod)
28	24, 26, 27	syl2anc 593	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ((ringLMod‘𝑅) ↑_s 𝑉) ∈ LMod)
29		frlmsplit2.z	. . . . . . 7 ⊢ 𝑍 = (𝑅 freeLMod 𝑉)
30		frlmsplit2.c	. . . . . . 7 ⊢ 𝐶 = (Base‘𝑍)
31		eqid 2762	. . . . . . 7 ⊢ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑉)) = (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑉))
32	29, 30, 31	frlmlss 21803	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑉 ∈ V) → 𝐶 ∈ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑉)))
33	1, 26, 32	syl2anc 593	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝐶 ∈ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑉)))
34	11	rneqd 5914	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ran ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) = ran (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)))
35		eqid 2762	. . . . . . . . . . . . 13 ⊢ (Base‘𝑅) = (Base‘𝑅)
36	3, 35, 4	frlmbasf 21812	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑥 ∈ 𝐵) → 𝑥:𝑈⟶(Base‘𝑅))
37	2, 36	sylan 589	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → 𝑥:𝑈⟶(Base‘𝑅))
38		simpl3 1207	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → 𝑉 ⊆ 𝑈)
39	37, 38	fssresd 6731	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → (𝑥 ↾ 𝑉):𝑉⟶(Base‘𝑅))
40		fvex 6880	. . . . . . . . . . . 12 ⊢ (Base‘𝑅) ∈ V
41		elmapg 8820	. . . . . . . . . . . 12 ⊢ (((Base‘𝑅) ∈ V ∧ 𝑉 ∈ V) → ((𝑥 ↾ 𝑉) ∈ ((Base‘𝑅) ↑_m 𝑉) ↔ (𝑥 ↾ 𝑉):𝑉⟶(Base‘𝑅)))
42	40, 26, 41	sylancr 596	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ((𝑥 ↾ 𝑉) ∈ ((Base‘𝑅) ↑_m 𝑉) ↔ (𝑥 ↾ 𝑉):𝑉⟶(Base‘𝑅)))
43	42	adantr 484	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ↾ 𝑉) ∈ ((Base‘𝑅) ↑_m 𝑉) ↔ (𝑥 ↾ 𝑉):𝑉⟶(Base‘𝑅)))
44	39, 43	mpbird 259	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → (𝑥 ↾ 𝑉) ∈ ((Base‘𝑅) ↑_m 𝑉))
45		eqid 2762	. . . . . . . . . . . 12 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
46	3, 45, 4	frlmbasfsupp 21810	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑥 ∈ 𝐵) → 𝑥 finSupp (0_g‘𝑅))
47	2, 46	sylan 589	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → 𝑥 finSupp (0_g‘𝑅))
48		fvexd 6882	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → (0_g‘𝑅) ∈ V)
49	47, 48	fsuppres 9339	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → (𝑥 ↾ 𝑉) finSupp (0_g‘𝑅))
50	29, 35, 45, 30	frlmelbas 21808	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ 𝑉 ∈ V) → ((𝑥 ↾ 𝑉) ∈ 𝐶 ↔ ((𝑥 ↾ 𝑉) ∈ ((Base‘𝑅) ↑_m 𝑉) ∧ (𝑥 ↾ 𝑉) finSupp (0_g‘𝑅))))
51	1, 26, 50	syl2anc 593	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ((𝑥 ↾ 𝑉) ∈ 𝐶 ↔ ((𝑥 ↾ 𝑉) ∈ ((Base‘𝑅) ↑_m 𝑉) ∧ (𝑥 ↾ 𝑉) finSupp (0_g‘𝑅))))
52	51	adantr 484	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ↾ 𝑉) ∈ 𝐶 ↔ ((𝑥 ↾ 𝑉) ∈ ((Base‘𝑅) ↑_m 𝑉) ∧ (𝑥 ↾ 𝑉) finSupp (0_g‘𝑅))))
53	44, 49, 52	mpbir2and 723	. . . . . . . 8 ⊢ (((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) ∧ 𝑥 ∈ 𝐵) → (𝑥 ↾ 𝑉) ∈ 𝐶)
54	53	fmpttd 7096	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)):𝐵⟶𝐶)
55	54	frnd 6700	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ran (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)) ⊆ 𝐶)
56	34, 55	eqsstrd 3970	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ran ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ⊆ 𝐶)
57		eqid 2762	. . . . . 6 ⊢ (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶) = (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶)
58	57, 31	reslmhm2b 21121	. . . . 5 ⊢ ((((ringLMod‘𝑅) ↑_s 𝑉) ∈ LMod ∧ 𝐶 ∈ (LSubSp‘((ringLMod‘𝑅) ↑_s 𝑉)) ∧ ran ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ⊆ 𝐶) → (((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom ((ringLMod‘𝑅) ↑_s 𝑉)) ↔ ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶))))
59	28, 33, 56, 58	syl3anc 1390	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → (((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom ((ringLMod‘𝑅) ↑_s 𝑉)) ↔ ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶))))
60	23, 59	mpbid 234	. . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → ((𝑥 ∈ (Base‘((ringLMod‘𝑅) ↑_s 𝑈)) ↦ (𝑥 ↾ 𝑉)) ↾ 𝐵) ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶)))
61	13, 60	eqeltrrd 2863	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝐹 ∈ ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶)))
62	3, 4	frlmpws 21802	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋) → 𝑌 = (((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵))
63	1, 2, 62	syl2anc 593	. . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝑌 = (((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵))
64	29, 30	frlmpws 21802	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑉 ∈ V) → 𝑍 = (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶))
65	1, 26, 64	syl2anc 593	. . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝑍 = (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶))
66	63, 65	oveq12d 7414	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → (𝑌 LMHom 𝑍) = ((((ringLMod‘𝑅) ↑_s 𝑈) ↾_s 𝐵) LMHom (((ringLMod‘𝑅) ↑_s 𝑉) ↾_s 𝐶)))
67	61, 66	eleqtrrd 2865	1 ⊢ ((𝑅 ∈ Ring ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ⊆ 𝑈) → 𝐹 ∈ (𝑌 LMHom 𝑍))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ⊆ wss 3904 class class class wbr 5100 ↦ cmpt 5181 ran crn 5648 ↾ cres 5649 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 ↑_m cmap 8808 finSupp cfsupp 9307 Basecbs 17245 ↾_s cress 17266 0_gc0g 17468 ↑_s cpws 17475 Ringcrg 20283 LModclmod 20927 LSubSpclss 20998 LMHom clmhm 21086 ringLModcrglmod 21239 freeLMod cfrlm 21798

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-of 7660 df-om 7847 df-1st 7970 df-2nd 7971 df-supp 8141 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-map 8810 df-ixp 8880 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-fsupp 9308 df-sup 9388 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-n0 12482 df-z 12569 df-dec 12689 df-uz 12840 df-fz 13513 df-struct 17183 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-mulr 17300 df-sca 17302 df-vsca 17303 df-ip 17304 df-tset 17305 df-ple 17306 df-ds 17308 df-hom 17310 df-cco 17311 df-0g 17470 df-prds 17476 df-pws 17478 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-mhm 18817 df-submnd 18818 df-grp 18978 df-minusg 18979 df-sbg 18980 df-subg 19165 df-ghm 19254 df-cmn 19822 df-abl 19823 df-mgp 20187 df-rng 20199 df-ur 20232 df-ring 20285 df-subrg 20620 df-lmod 20929 df-lss 20999 df-lmhm 21089 df-sra 21240 df-rgmod 21241 df-dsmm 21784 df-frlm 21799

This theorem is referenced by: frlmsslss 21826

W3C validator