tendospcanN - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > tendospcanN		Structured version Visualization version GIF version

Theorem tendospcanN 39889

Description: Cancellation law for trace-preserving endomorphism values (used as scalar product). (Contributed by NM, 7-Apr-2014.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
tendospcan.b	⊢ 𝐵 = (Base‘𝐾)
tendospcan.h	⊢ 𝐻 = (LHyp‘𝐾)
tendospcan.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendospcan.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
tendospcan.o	⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))

**Assertion**
Ref	Expression
tendospcanN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐸 ∧ 𝑆 ≠ 𝑂) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑆‘𝐹) = (𝑆‘𝐺) ↔ 𝐹 = 𝐺))

Distinct variable groups: 𝐵,𝑓 𝑇,𝑓 Allowed substitution hints: 𝑆(𝑓) 𝐸(𝑓) 𝐹(𝑓) 𝐺(𝑓) 𝐻(𝑓) 𝐾(𝑓) 𝑂(𝑓) 𝑊(𝑓)

**Proof of Theorem tendospcanN**
Step	Hyp	Ref	Expression
1		tendospcan.h	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐻 = (LHyp‘𝐾)
2		tendospcan.t	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
3		tendospcan.e	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
4	1, 2, 3	tendocnv 39887	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐺 ∈ 𝑇) → ^◡(𝑆‘𝐺) = (𝑆‘^◡𝐺))
5	4	3adant3l 1180	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ^◡(𝑆‘𝐺) = (𝑆‘^◡𝐺))
6	5	coeq2d 5862	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑆‘𝐹) ∘ ^◡(𝑆‘𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘^◡𝐺)))
7		simp1 1136	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
8		simp2 1137	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → 𝑆 ∈ 𝐸)
9		simp3l 1201	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → 𝐹 ∈ 𝑇)
10		simp3r 1202	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → 𝐺 ∈ 𝑇)
11	1, 2	ltrncnv 39012	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → ^◡𝐺 ∈ 𝑇)
12	7, 10, 11	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ^◡𝐺 ∈ 𝑇)
13	1, 2, 3	tendospdi1 39886	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ ^◡𝐺 ∈ 𝑇)) → (𝑆‘(𝐹 ∘ ^◡𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘^◡𝐺)))
14	7, 8, 9, 12, 13	syl13anc 1372	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝑆‘(𝐹 ∘ ^◡𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘^◡𝐺)))
15	6, 14	eqtr4d 2775	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑆‘𝐹) ∘ ^◡(𝑆‘𝐺)) = (𝑆‘(𝐹 ∘ ^◡𝐺)))
16	15	adantr 481	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → ((𝑆‘𝐹) ∘ ^◡(𝑆‘𝐺)) = (𝑆‘(𝐹 ∘ ^◡𝐺)))
17	16	eqeq1d 2734	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → (((𝑆‘𝐹) ∘ ^◡(𝑆‘𝐺)) = ( I ↾ 𝐵) ↔ (𝑆‘(𝐹 ∘ ^◡𝐺)) = ( I ↾ 𝐵)))
18		simpl1 1191	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
19		simpl2 1192	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → 𝑆 ∈ 𝐸)
20		simpl3l 1228	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → 𝐹 ∈ 𝑇)
21	1, 2, 3	tendocl 39633	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑆‘𝐹) ∈ 𝑇)
22	18, 19, 20, 21	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → (𝑆‘𝐹) ∈ 𝑇)
23		simpl3r 1229	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → 𝐺 ∈ 𝑇)
24	1, 2, 3	tendocl 39633	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐺 ∈ 𝑇) → (𝑆‘𝐺) ∈ 𝑇)
25	18, 19, 23, 24	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → (𝑆‘𝐺) ∈ 𝑇)
26		tendospcan.b	. . . . . . . . . . . . . 14 ⊢ 𝐵 = (Base‘𝐾)
27	26, 1, 2	ltrncoidN 38994	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆‘𝐹) ∈ 𝑇 ∧ (𝑆‘𝐺) ∈ 𝑇) → (((𝑆‘𝐹) ∘ ^◡(𝑆‘𝐺)) = ( I ↾ 𝐵) ↔ (𝑆‘𝐹) = (𝑆‘𝐺)))
28	18, 22, 25, 27	syl3anc 1371	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → (((𝑆‘𝐹) ∘ ^◡(𝑆‘𝐺)) = ( I ↾ 𝐵) ↔ (𝑆‘𝐹) = (𝑆‘𝐺)))
29	18, 23, 11	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → ^◡𝐺 ∈ 𝑇)
30	1, 2	ltrnco 39585	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ^◡𝐺 ∈ 𝑇) → (𝐹 ∘ ^◡𝐺) ∈ 𝑇)
31	18, 20, 29, 30	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → (𝐹 ∘ ^◡𝐺) ∈ 𝑇)
32		simpr 485	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵))
33		tendospcan.o	. . . . . . . . . . . . . 14 ⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))
34	26, 1, 2, 3, 33	tendoid0 39691	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ ((𝐹 ∘ ^◡𝐺) ∈ 𝑇 ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵))) → ((𝑆‘(𝐹 ∘ ^◡𝐺)) = ( I ↾ 𝐵) ↔ 𝑆 = 𝑂))
35	18, 19, 31, 32, 34	syl112anc 1374	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → ((𝑆‘(𝐹 ∘ ^◡𝐺)) = ( I ↾ 𝐵) ↔ 𝑆 = 𝑂))
36	17, 28, 35	3bitr3d 308	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → ((𝑆‘𝐹) = (𝑆‘𝐺) ↔ 𝑆 = 𝑂))
37	36	biimpd 228	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵)) → ((𝑆‘𝐹) = (𝑆‘𝐺) → 𝑆 = 𝑂))
38	37	impancom 452	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑆‘𝐹) = (𝑆‘𝐺)) → ((𝐹 ∘ ^◡𝐺) ≠ ( I ↾ 𝐵) → 𝑆 = 𝑂))
39	38	necon1d 2962	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑆‘𝐹) = (𝑆‘𝐺)) → (𝑆 ≠ 𝑂 → (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)))
40		simpl1 1191	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑆‘𝐹) = (𝑆‘𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
41		simpl3l 1228	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑆‘𝐹) = (𝑆‘𝐺)) → 𝐹 ∈ 𝑇)
42		simpl3r 1229	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑆‘𝐹) = (𝑆‘𝐺)) → 𝐺 ∈ 𝑇)
43	26, 1, 2	ltrncoidN 38994	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ((𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵) ↔ 𝐹 = 𝐺))
44	40, 41, 42, 43	syl3anc 1371	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑆‘𝐹) = (𝑆‘𝐺)) → ((𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵) ↔ 𝐹 = 𝐺))
45	39, 44	sylibd 238	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑆‘𝐹) = (𝑆‘𝐺)) → (𝑆 ≠ 𝑂 → 𝐹 = 𝐺))
46	45	3exp1 1352	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ((𝑆‘𝐹) = (𝑆‘𝐺) → (𝑆 ≠ 𝑂 → 𝐹 = 𝐺)))))
47	46	com24 95	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ((𝑆‘𝐹) = (𝑆‘𝐺) → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑆 ∈ 𝐸 → (𝑆 ≠ 𝑂 → 𝐹 = 𝐺)))))
48	47	imp5a 441	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ((𝑆‘𝐹) = (𝑆‘𝐺) → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ((𝑆 ∈ 𝐸 ∧ 𝑆 ≠ 𝑂) → 𝐹 = 𝐺))))
49	48	com24 95	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ((𝑆 ∈ 𝐸 ∧ 𝑆 ≠ 𝑂) → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ((𝑆‘𝐹) = (𝑆‘𝐺) → 𝐹 = 𝐺))))
50	49	3imp 1111	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐸 ∧ 𝑆 ≠ 𝑂) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑆‘𝐹) = (𝑆‘𝐺) → 𝐹 = 𝐺))
51		fveq2 6891	. 2 ⊢ (𝐹 = 𝐺 → (𝑆‘𝐹) = (𝑆‘𝐺))
52	50, 51	impbid1 224	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐸 ∧ 𝑆 ≠ 𝑂) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑆‘𝐹) = (𝑆‘𝐺) ↔ 𝐹 = 𝐺))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ↦ cmpt 5231 I cid 5573 ^◡ccnv 5675 ↾ cres 5678 ∘ ccom 5680 ‘cfv 6543 Basecbs 17143 HLchlt 38215 LHypclh 38850 LTrncltrn 38967 TEndoctendo 39618

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-riotaBAD 37818

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7974 df-2nd 7975 df-undef 8257 df-map 8821 df-proset 18247 df-poset 18265 df-plt 18282 df-lub 18298 df-glb 18299 df-join 18300 df-meet 18301 df-p0 18377 df-p1 18378 df-lat 18384 df-clat 18451 df-oposet 38041 df-ol 38043 df-oml 38044 df-covers 38131 df-ats 38132 df-atl 38163 df-cvlat 38187 df-hlat 38216 df-llines 38364 df-lplanes 38365 df-lvols 38366 df-lines 38367 df-psubsp 38369 df-pmap 38370 df-padd 38662 df-lhyp 38854 df-laut 38855 df-ldil 38970 df-ltrn 38971 df-trl 39025 df-tendo 39621

This theorem is referenced by: dihmeetlem13N 40185

W3C validator