dihordlem7b - Mathbox for Norm Megill

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

Theorem dihordlem7b 42017

Description: Part of proof of Lemma N of [Crawley] p. 122. Reverse ordering property. (Contributed by NM, 3-Mar-2014.)

**Hypotheses**
Ref	Expression
dihordlem8.b	⊢ 𝐵 = (Base‘𝐾)
dihordlem8.l	⊢ ≤ = (le‘𝐾)
dihordlem8.a	⊢ 𝐴 = (Atoms‘𝐾)
dihordlem8.h	⊢ 𝐻 = (LHyp‘𝐾)
dihordlem8.p	⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
dihordlem8.o	⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
dihordlem8.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
dihordlem8.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
dihordlem8.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
dihordlem8.s	⊢ + = (+_g‘𝑈)
dihordlem8.g	⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅)

**Assertion**
Ref	Expression
dihordlem7b	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑓 = 𝑔 ∧ 𝑂 = 𝑠))

Distinct variable groups: ≤ ,ℎ 𝐴,ℎ 𝐵,ℎ ℎ,𝐻 ℎ,𝐾 𝑃,ℎ 𝑅,ℎ 𝑇,ℎ ℎ,𝑊 Allowed substitution hints: 𝐴(𝑓, 𝑔, 𝑠) 𝐵(𝑓, 𝑔, 𝑠) 𝑃(𝑓, 𝑔, 𝑠) + (𝑓, 𝑔, ℎ, 𝑠) 𝑄(𝑓, 𝑔, ℎ, 𝑠) 𝑅(𝑓, 𝑔, 𝑠) 𝑇(𝑓, 𝑔, 𝑠) 𝑈(𝑓, 𝑔, ℎ, 𝑠) 𝐸(𝑓, 𝑔, ℎ, 𝑠) 𝐺(𝑓, 𝑔, ℎ, 𝑠) 𝐻(𝑓, 𝑔, 𝑠) 𝐾(𝑓, 𝑔, 𝑠) ≤ (𝑓, 𝑔, 𝑠) 𝑂(𝑓, 𝑔, ℎ, 𝑠) 𝑊(𝑓, 𝑔, 𝑠)

**Proof of Theorem dihordlem7b**
Step	Hyp	Ref	Expression
1		dihordlem8.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
2		dihordlem8.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
3		dihordlem8.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
4		dihordlem8.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
5		dihordlem8.p	. . . . 5 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
6		dihordlem8.o	. . . . 5 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
7		dihordlem8.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8		dihordlem8.e	. . . . 5 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
9		dihordlem8.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
10		dihordlem8.s	. . . . 5 ⊢ + = (+_g‘𝑈)
11		dihordlem8.g	. . . . 5 ⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅)
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	dihordlem7 42016	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑓 = ((𝑠‘𝐺) ∘ 𝑔) ∧ 𝑂 = 𝑠))
13	12	simpld 499	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → 𝑓 = ((𝑠‘𝐺) ∘ 𝑔))
14	12	simprd 500	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → 𝑂 = 𝑠)
15	14	fveq1d 6883	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑂‘𝐺) = (𝑠‘𝐺))
16		simp1 1153	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17	2, 3, 4, 5	lhpocnel2 40821	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
18	17	3ad2ant1 1150	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
19		simp2r 1218	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊))
20	2, 3, 4, 7, 11	ltrniotacl 41381	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
21	16, 18, 19, 20	syl3anc 1397	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → 𝐺 ∈ 𝑇)
22	6, 1	tendo02 41589	. . . . . 6 ⊢ (𝐺 ∈ 𝑇 → (𝑂‘𝐺) = ( I ↾ 𝐵))
23	21, 22	syl 18	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑂‘𝐺) = ( I ↾ 𝐵))
24	15, 23	eqtr3d 2799	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑠‘𝐺) = ( I ↾ 𝐵))
25	24	coeq1d 5846	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → ((𝑠‘𝐺) ∘ 𝑔) = (( I ↾ 𝐵) ∘ 𝑔))
26		simp32 1228	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → 𝑔 ∈ 𝑇)
27	1, 4, 7	ltrn1o 40926	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑔 ∈ 𝑇) → 𝑔:𝐵–1-1-onto→𝐵)
28	16, 26, 27	syl2anc 595	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → 𝑔:𝐵–1-1-onto→𝐵)
29		f1of 6820	. . . 4 ⊢ (𝑔:𝐵–1-1-onto→𝐵 → 𝑔:𝐵⟶𝐵)
30		fcoi2 6753	. . . 4 ⊢ (𝑔:𝐵⟶𝐵 → (( I ↾ 𝐵) ∘ 𝑔) = 𝑔)
31	28, 29, 30	3syl 19	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (( I ↾ 𝐵) ∘ 𝑔) = 𝑔)
32	13, 25, 31	3eqtrd 2801	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → 𝑓 = 𝑔)
33	32, 14	jca 520	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ ⟨𝑓, 𝑂⟩ = (⟨(𝑠‘𝐺), 𝑠⟩ + ⟨𝑔, 𝑂⟩))) → (𝑓 = 𝑔 ∧ 𝑂 = 𝑠))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ⟨cop 4594 class class class wbr 5108 ↦ cmpt 5191 I cid 5554 ↾ cres 5662 ∘ ccom 5664 ⟶wf 6532 –1-1-onto→wf1o 6535 ‘cfv 6536 ℩crio 7368 (class class class)co 7412 Basecbs 17275 +_gcplusg 17316 lecple 17323 occoc 17324 Atomscatm 40065 HLchlt 40152 LHypclh 40786 LTrncltrn 40903 TEndoctendo 41554 DVecHcdvh 41880

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-riotaBAD 39755

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-undef 8267 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-er 8692 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-5 12312 df-6 12313 df-n0 12511 df-z 12598 df-uz 12869 df-fz 13542 df-struct 17213 df-slot 17248 df-ndx 17260 df-base 17276 df-plusg 17329 df-mulr 17330 df-sca 17332 df-vsca 17333 df-proset 18356 df-poset 18375 df-plt 18390 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-p0 18485 df-p1 18486 df-lat 18494 df-clat 18561 df-oposet 39978 df-ol 39980 df-oml 39981 df-covers 40068 df-ats 40069 df-atl 40100 df-cvlat 40124 df-hlat 40153 df-llines 40300 df-lplanes 40301 df-lvols 40302 df-lines 40303 df-psubsp 40305 df-pmap 40306 df-padd 40598 df-lhyp 40790 df-laut 40791 df-ldil 40906 df-ltrn 40907 df-trl 40961 df-tendo 41557 df-edring 41559 df-dvech 41881

This theorem is used by: dihord10 42025

W3C validator