Theorem lsspropd 19524

Description: If two structures have the same components (properties), they have the same subspace structure. (Contributed by Mario Carneiro, 9-Feb-2015.) (Revised by Mario Carneiro, 14-Jun-2015.)

Hypotheses

Ref	Expression
lsspropd.b1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
lsspropd.b2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
lsspropd.w	⊢ (𝜑 → 𝐵 ⊆ 𝑊)
lsspropd.p	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
lsspropd.s1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ 𝑊)
lsspropd.s2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))
lsspropd.p1	⊢ (𝜑 → 𝑃 = (Base‘(Scalar‘𝐾)))
lsspropd.p2	⊢ (𝜑 → 𝑃 = (Base‘(Scalar‘𝐿)))

Assertion

Ref	Expression
lsspropd	⊢ (𝜑 → (LSubSp‘𝐾) = (LSubSp‘𝐿))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝜑,𝑥,𝑦   𝑥,𝑊,𝑦   𝑥,𝐿,𝑦   𝑥,𝑃,𝑦

Proof of Theorem lsspropd

Dummy variables 𝑎 𝑏 𝑧 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 755	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝜑)
2		simprl 759	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝑧 ∈ 𝑃)
3		simplr 757	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝑠 ⊆ 𝐵)
4		simprrl 769	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝑎 ∈ 𝑠)
5	3, 4	sseldd 3854	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝑎 ∈ 𝐵)
6		lsspropd.s1	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ 𝑊)
7	6	ralrimivva 3136	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝐵 (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ 𝑊)
8	7	ad2antrr 714	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝐵 (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ 𝑊)
9		ovrspc2v 7001	. . . . . . . . . . . . . 14 ⊢ (((𝑧 ∈ 𝑃 ∧ 𝑎 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝐵 (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ 𝑊) → (𝑧( ·𝑠 ‘𝐾)𝑎) ∈ 𝑊)
10	2, 5, 8, 9	syl21anc 826	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → (𝑧( ·𝑠 ‘𝐾)𝑎) ∈ 𝑊)
11		lsspropd.w	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ⊆ 𝑊)
12	11	ad2antrr 714	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝐵 ⊆ 𝑊)
13		simprrr 770	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝑏 ∈ 𝑠)
14	3, 13	sseldd 3854	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝑏 ∈ 𝐵)
15	12, 14	sseldd 3854	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → 𝑏 ∈ 𝑊)
16		lsspropd.p	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
17	16	oveqrspc2v 7002	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑧( ·𝑠 ‘𝐾)𝑎) ∈ 𝑊 ∧ 𝑏 ∈ 𝑊)) → ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) = ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐿)𝑏))
18	1, 10, 15, 17	syl12anc 825	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) = ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐿)𝑏))
19		lsspropd.s2	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))
20	19	oveqrspc2v 7002	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑃 ∧ 𝑎 ∈ 𝐵)) → (𝑧( ·𝑠 ‘𝐾)𝑎) = (𝑧( ·𝑠 ‘𝐿)𝑎))
21	1, 2, 5, 20	syl12anc 825	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → (𝑧( ·𝑠 ‘𝐾)𝑎) = (𝑧( ·𝑠 ‘𝐿)𝑎))
22	21	oveq1d 6990	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐿)𝑏) = ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏))
23	18, 22	eqtrd 2809	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) = ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏))
24	23	eleq1d 2845	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ (𝑧 ∈ 𝑃 ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠))) → (((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠 ↔ ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠))
25	24	anassrs 460	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ 𝑧 ∈ 𝑃) ∧ (𝑎 ∈ 𝑠 ∧ 𝑏 ∈ 𝑠)) → (((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠 ↔ ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠))
26	25	2ralbidva 3143	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ⊆ 𝐵) ∧ 𝑧 ∈ 𝑃) → (∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠 ↔ ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠))
27	26	ralbidva 3141	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐵) → (∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠 ↔ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠))
28	27	anbi2d 620	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐵) → ((𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠) ↔ (𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠)))
29	28	pm5.32da 571	. . . . 5 ⊢ (𝜑 → ((𝑠 ⊆ 𝐵 ∧ (𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠)) ↔ (𝑠 ⊆ 𝐵 ∧ (𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠))))
30		3anass 1077	. . . . 5 ⊢ ((𝑠 ⊆ 𝐵 ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠) ↔ (𝑠 ⊆ 𝐵 ∧ (𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠)))
31		3anass 1077	. . . . 5 ⊢ ((𝑠 ⊆ 𝐵 ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠) ↔ (𝑠 ⊆ 𝐵 ∧ (𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠)))
32	29, 30, 31	3bitr4g 306	. . . 4 ⊢ (𝜑 → ((𝑠 ⊆ 𝐵 ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠) ↔ (𝑠 ⊆ 𝐵 ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠)))
33		lsspropd.b1	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
34	33	sseq2d 3884	. . . . 5 ⊢ (𝜑 → (𝑠 ⊆ 𝐵 ↔ 𝑠 ⊆ (Base‘𝐾)))
35		lsspropd.p1	. . . . . 6 ⊢ (𝜑 → 𝑃 = (Base‘(Scalar‘𝐾)))
36	35	raleqdv 3350	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠 ↔ ∀𝑧 ∈ (Base‘(Scalar‘𝐾))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠))
37	34, 36	3anbi13d 1418	. . . 4 ⊢ (𝜑 → ((𝑠 ⊆ 𝐵 ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠) ↔ (𝑠 ⊆ (Base‘𝐾) ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ (Base‘(Scalar‘𝐾))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠)))
38		lsspropd.b2	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
39	38	sseq2d 3884	. . . . 5 ⊢ (𝜑 → (𝑠 ⊆ 𝐵 ↔ 𝑠 ⊆ (Base‘𝐿)))
40		lsspropd.p2	. . . . . 6 ⊢ (𝜑 → 𝑃 = (Base‘(Scalar‘𝐿)))
41	40	raleqdv 3350	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠 ↔ ∀𝑧 ∈ (Base‘(Scalar‘𝐿))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠))
42	39, 41	3anbi13d 1418	. . . 4 ⊢ (𝜑 → ((𝑠 ⊆ 𝐵 ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ 𝑃 ∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠) ↔ (𝑠 ⊆ (Base‘𝐿) ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ (Base‘(Scalar‘𝐿))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠)))
43	32, 37, 42	3bitr3d 301	. . 3 ⊢ (𝜑 → ((𝑠 ⊆ (Base‘𝐾) ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ (Base‘(Scalar‘𝐾))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠) ↔ (𝑠 ⊆ (Base‘𝐿) ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ (Base‘(Scalar‘𝐿))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠)))
44		eqid 2773	. . . 4 ⊢ (Scalar‘𝐾) = (Scalar‘𝐾)
45		eqid 2773	. . . 4 ⊢ (Base‘(Scalar‘𝐾)) = (Base‘(Scalar‘𝐾))
46		eqid 2773	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
47		eqid 2773	. . . 4 ⊢ (+g‘𝐾) = (+g‘𝐾)
48		eqid 2773	. . . 4 ⊢ ( ·𝑠 ‘𝐾) = ( ·𝑠 ‘𝐾)
49		eqid 2773	. . . 4 ⊢ (LSubSp‘𝐾) = (LSubSp‘𝐾)
50	44, 45, 46, 47, 48, 49	islss 19441	. . 3 ⊢ (𝑠 ∈ (LSubSp‘𝐾) ↔ (𝑠 ⊆ (Base‘𝐾) ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ (Base‘(Scalar‘𝐾))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐾)𝑎)(+g‘𝐾)𝑏) ∈ 𝑠))
51		eqid 2773	. . . 4 ⊢ (Scalar‘𝐿) = (Scalar‘𝐿)
52		eqid 2773	. . . 4 ⊢ (Base‘(Scalar‘𝐿)) = (Base‘(Scalar‘𝐿))
53		eqid 2773	. . . 4 ⊢ (Base‘𝐿) = (Base‘𝐿)
54		eqid 2773	. . . 4 ⊢ (+g‘𝐿) = (+g‘𝐿)
55		eqid 2773	. . . 4 ⊢ ( ·𝑠 ‘𝐿) = ( ·𝑠 ‘𝐿)
56		eqid 2773	. . . 4 ⊢ (LSubSp‘𝐿) = (LSubSp‘𝐿)
57	51, 52, 53, 54, 55, 56	islss 19441	. . 3 ⊢ (𝑠 ∈ (LSubSp‘𝐿) ↔ (𝑠 ⊆ (Base‘𝐿) ∧ 𝑠 ≠ ∅ ∧ ∀𝑧 ∈ (Base‘(Scalar‘𝐿))∀𝑎 ∈ 𝑠 ∀𝑏 ∈ 𝑠 ((𝑧( ·𝑠 ‘𝐿)𝑎)(+g‘𝐿)𝑏) ∈ 𝑠))
58	43, 50, 57	3bitr4g 306	. 2 ⊢ (𝜑 → (𝑠 ∈ (LSubSp‘𝐾) ↔ 𝑠 ∈ (LSubSp‘𝐿)))
59	58	eqrdv 2771	1 ⊢ (𝜑 → (LSubSp‘𝐾) = (LSubSp‘𝐿))

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 387   ∧ w3a 1069   = wceq 1508   ∈ wcel 2051   ≠ wne 2962  ∀wral 3083   ⊆ wss 3824  ∅c0 4173  ‘cfv 6186  (class class class)co 6975  Basecbs 16338  +_gcplusg 16420  Scalarcsca 16423   ·_𝑠 cvsca 16424  LSubSpclss 19438

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1759  ax-4 1773  ax-5 1870  ax-6 1929  ax-7 1966  ax-8 2053  ax-9 2060  ax-10 2080  ax-11 2094  ax-12 2107  ax-13 2302  ax-ext 2745  ax-sep 5057  ax-nul 5064  ax-pow 5116  ax-pr 5183

This theorem depends on definitions:  df-bi 199  df-an 388  df-or 835  df-3an 1071  df-tru 1511  df-ex 1744  df-nf 1748  df-sb 2017  df-mo 2548  df-eu 2585  df-clab 2754  df-cleq 2766  df-clel 2841  df-nfc 2913  df-ne 2963  df-ral 3088  df-rex 3089  df-rab 3092  df-v 3412  df-sbc 3677  df-dif 3827  df-un 3829  df-in 3831  df-ss 3838  df-nul 4174  df-if 4346  df-pw 4419  df-sn 4437  df-pr 4439  df-op 4443  df-uni 4710  df-br 4927  df-opab 4989  df-mpt 5006  df-id 5309  df-xp 5410  df-rel 5411  df-cnv 5412  df-co 5413  df-dm 5414  df-iota 6150  df-fun 6188  df-fv 6194  df-ov 6978  df-lss 19439

This theorem is referenced by:  lsppropd  19525  lidlrsppropd  19737  ply1lss  20083