Theorem islbs 21234

Description: The predicate "𝐵 is a basis for the left module or vector space 𝑊". A subset of the base set is a basis if zero is not in the set, it spans the set, and no nonzero multiple of an element of the basis is in the span of the rest of the family. (Contributed by Mario Carneiro, 24-Jun-2014.) (Revised by Mario Carneiro, 14-Jan-2015.)

Hypotheses

Ref	Expression
islbs.v	⊢ 𝑉 = (Base‘𝑊)
islbs.f	⊢ 𝐹 = (Scalar‘𝑊)
islbs.s	⊢ · = ( ·𝑠 ‘𝑊)
islbs.k	⊢ 𝐾 = (Base‘𝐹)
islbs.j	⊢ 𝐽 = (LBasis‘𝑊)
islbs.n	⊢ 𝑁 = (LSpan‘𝑊)
islbs.z	⊢ 0 = (0g‘𝐹)

Assertion

Ref	Expression
islbs	⊢ (𝑊 ∈ 𝑋 → (𝐵 ∈ 𝐽 ↔ (𝐵 ⊆ 𝑉 ∧ (𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑦,𝐾   𝑥,𝑁,𝑦   𝑥,𝑊,𝑦   𝑥,𝐹,𝑦   𝑦, 0

Allowed substitution hints:   · (𝑥, 𝑦)   𝐽(𝑥, 𝑦)   𝐾(𝑥)   𝑉(𝑥, 𝑦)   𝑋(𝑥, 𝑦)   0 (𝑥)

Proof of Theorem islbs

Dummy variables 𝑏 𝑓 𝑛 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3479	. . . 4 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
2		islbs.j	. . . . 5 ⊢ 𝐽 = (LBasis‘𝑊)
3		fveq2 6888	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4		islbs.v	. . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑊)
5	3, 4	eqtr4di 2819	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
6	5	pweqd 4584	. . . . . . 7 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
7		fvexd 6903	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) ∈ V)
8		fveq2 6888	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = (LSpan‘𝑊))
9		islbs.n	. . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑊)
10	8, 9	eqtr4di 2819	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSpan‘𝑤) = 𝑁)
11		fvexd 6903	. . . . . . . . 9 ⊢ ((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) → (Scalar‘𝑤) ∈ V)
12		fveq2 6888	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
13	12	adantr 486	. . . . . . . . . 10 ⊢ ((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) → (Scalar‘𝑤) = (Scalar‘𝑊))
14		islbs.f	. . . . . . . . . 10 ⊢ 𝐹 = (Scalar‘𝑊)
15	13, 14	eqtr4di 2819	. . . . . . . . 9 ⊢ ((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) → (Scalar‘𝑤) = 𝐹)
16		simplr 781	. . . . . . . . . . . 12 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → 𝑛 = 𝑁)
17	16	fveq1d 6890	. . . . . . . . . . 11 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (𝑛‘𝑏) = (𝑁‘𝑏))
18	5	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (Base‘𝑤) = 𝑉)
19	17, 18	eqeq12d 2782	. . . . . . . . . 10 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → ((𝑛‘𝑏) = (Base‘𝑤) ↔ (𝑁‘𝑏) = 𝑉))
20		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
21	20	fveq2d 6892	. . . . . . . . . . . . . 14 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (Base‘𝑓) = (Base‘𝐹))
22		islbs.k	. . . . . . . . . . . . . 14 ⊢ 𝐾 = (Base‘𝐹)
23	21, 22	eqtr4di 2819	. . . . . . . . . . . . 13 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (Base‘𝑓) = 𝐾)
24	20	fveq2d 6892	. . . . . . . . . . . . . . 15 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (0g‘𝑓) = (0g‘𝐹))
25		islbs.z	. . . . . . . . . . . . . . 15 ⊢ 0 = (0g‘𝐹)
26	24, 25	eqtr4di 2819	. . . . . . . . . . . . . 14 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (0g‘𝑓) = 0 )
27	26	sneqd 4606	. . . . . . . . . . . . 13 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → {(0g‘𝑓)} = { 0 })
28	23, 27	difeq12d 4085	. . . . . . . . . . . 12 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → ((Base‘𝑓) ∖ {(0g‘𝑓)}) = (𝐾 ∖ { 0 }))
29		fveq2 6888	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = ( ·𝑠 ‘𝑊))
30		islbs.s	. . . . . . . . . . . . . . . . 17 ⊢ · = ( ·𝑠 ‘𝑊)
31	29, 30	eqtr4di 2819	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = · )
32	31	ad2antrr 739	. . . . . . . . . . . . . . 15 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → ( ·𝑠 ‘𝑤) = · )
33	32	oveqd 7440	. . . . . . . . . . . . . 14 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (𝑦( ·𝑠 ‘𝑤)𝑥) = (𝑦 · 𝑥))
34	16	fveq1d 6890	. . . . . . . . . . . . . 14 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (𝑛‘(𝑏 ∖ {𝑥})) = (𝑁‘(𝑏 ∖ {𝑥})))
35	33, 34	eleq12d 2860	. . . . . . . . . . . . 13 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → ((𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥})) ↔ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥}))))
36	35	notbid 321	. . . . . . . . . . . 12 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥})) ↔ ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥}))))
37	28, 36	raleqbidv 3341	. . . . . . . . . . 11 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (∀𝑦 ∈ ((Base‘𝑓) ∖ {(0g‘𝑓)}) ¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥})) ↔ ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥}))))
38	37	ralbidv 3191	. . . . . . . . . 10 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ ((Base‘𝑓) ∖ {(0g‘𝑓)}) ¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥})) ↔ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥}))))
39	19, 38	anbi12d 644	. . . . . . . . 9 ⊢ (((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) ∧ 𝑓 = 𝐹) → (((𝑛‘𝑏) = (Base‘𝑤) ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ ((Base‘𝑓) ∖ {(0g‘𝑓)}) ¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥}))) ↔ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))))
40	11, 15, 39	sbcied2 3791	. . . . . . . 8 ⊢ ((𝑤 = 𝑊 ∧ 𝑛 = 𝑁) → ([(Scalar‘𝑤) / 𝑓]((𝑛‘𝑏) = (Base‘𝑤) ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ ((Base‘𝑓) ∖ {(0g‘𝑓)}) ¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥}))) ↔ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))))
41	7, 10, 40	sbcied2 3791	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ([(LSpan‘𝑤) / 𝑛][(Scalar‘𝑤) / 𝑓]((𝑛‘𝑏) = (Base‘𝑤) ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ ((Base‘𝑓) ∖ {(0g‘𝑓)}) ¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥}))) ↔ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))))
42	6, 41	rabeqbidv 3437	. . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑏 ∈ 𝒫 (Base‘𝑤) ∣ [(LSpan‘𝑤) / 𝑛][(Scalar‘𝑤) / 𝑓]((𝑛‘𝑏) = (Base‘𝑤) ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ ((Base‘𝑓) ∖ {(0g‘𝑓)}) ¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥})))} = {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))})
43		df-lbs 21233	. . . . . 6 ⊢ LBasis = (𝑤 ∈ V ↦ {𝑏 ∈ 𝒫 (Base‘𝑤) ∣ [(LSpan‘𝑤) / 𝑛][(Scalar‘𝑤) / 𝑓]((𝑛‘𝑏) = (Base‘𝑤) ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ ((Base‘𝑓) ∖ {(0g‘𝑓)}) ¬ (𝑦( ·𝑠 ‘𝑤)𝑥) ∈ (𝑛‘(𝑏 ∖ {𝑥})))})
44	4	fvexi 6902	. . . . . . . 8 ⊢ 𝑉 ∈ V
45	44	pwex 5356	. . . . . . 7 ⊢ 𝒫 𝑉 ∈ V
46	45	rabex 5314	. . . . . 6 ⊢ {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))} ∈ V
47	42, 43, 46	fvmpt 6996	. . . . 5 ⊢ (𝑊 ∈ V → (LBasis‘𝑊) = {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))})
48	2, 47	eqtrid 2813	. . . 4 ⊢ (𝑊 ∈ V → 𝐽 = {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))})
49	1, 48	syl 18	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝐽 = {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))})
50	49	eleq2d 2852	. 2 ⊢ (𝑊 ∈ 𝑋 → (𝐵 ∈ 𝐽 ↔ 𝐵 ∈ {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))}))
51	44	elpw2 5310	. . . 4 ⊢ (𝐵 ∈ 𝒫 𝑉 ↔ 𝐵 ⊆ 𝑉)
52	51	anbi1i 636	. . 3 ⊢ ((𝐵 ∈ 𝒫 𝑉 ∧ ((𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))) ↔ (𝐵 ⊆ 𝑉 ∧ ((𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
53		fveqeq2 6897	. . . . 5 ⊢ (𝑏 = 𝐵 → ((𝑁‘𝑏) = 𝑉 ↔ (𝑁‘𝐵) = 𝑉))
54		difeq1 4077	. . . . . . . . . 10 ⊢ (𝑏 = 𝐵 → (𝑏 ∖ {𝑥}) = (𝐵 ∖ {𝑥}))
55	54	fveq2d 6892	. . . . . . . . 9 ⊢ (𝑏 = 𝐵 → (𝑁‘(𝑏 ∖ {𝑥})) = (𝑁‘(𝐵 ∖ {𝑥})))
56	55	eleq2d 2852	. . . . . . . 8 ⊢ (𝑏 = 𝐵 → ((𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})) ↔ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))))
57	56	notbid 321	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})) ↔ ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))))
58	57	ralbidv 3191	. . . . . 6 ⊢ (𝑏 = 𝐵 → (∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})) ↔ ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))))
59	58	raleqbi1dv 3336	. . . . 5 ⊢ (𝑏 = 𝐵 → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))))
60	53, 59	anbi12d 644	. . . 4 ⊢ (𝑏 = 𝐵 → (((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥}))) ↔ ((𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
61	60	elrab 3653	. . 3 ⊢ (𝐵 ∈ {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))} ↔ (𝐵 ∈ 𝒫 𝑉 ∧ ((𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
62		3anass 1111	. . 3 ⊢ ((𝐵 ⊆ 𝑉 ∧ (𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))) ↔ (𝐵 ⊆ 𝑉 ∧ ((𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
63	52, 61, 62	3bitr4i 306	. 2 ⊢ (𝐵 ∈ {𝑏 ∈ 𝒫 𝑉 ∣ ((𝑁‘𝑏) = 𝑉 ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝑏 ∖ {𝑥})))} ↔ (𝐵 ⊆ 𝑉 ∧ (𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))))
64	50, 63	bitrdi 290	1 ⊢ (𝑊 ∈ 𝑋 → (𝐵 ∈ 𝐽 ↔ (𝐵 ⊆ 𝑉 ∧ (𝑁‘𝐵) = 𝑉 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3082  {crab 3419  Vcvv 3458  [wsbc 3747   ∖ cdif 3905   ⊆ wss 3908  𝒫 cpw 4567  {csn 4594  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  Scalarcsca 17338   ·_𝑠 cvsca 17339  0_gc0g 17517  LSpanclspn 21129  LBasisclbs 21232

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 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-lbs 21233

This theorem is used by:  lbsss  21235  lbssp  21237  lbsind  21238  lbspropd  21257  islbs2  21315  frlmlbs  21984  islbs4  22019