lcfrlem40 - Mathbox for Norm Megill

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

Theorem lcfrlem40 41571

Description: Lemma for lcfr 41574. Eliminate 𝐵 and 𝐼. (Contributed by NM, 11-Mar-2015.)

**Hypotheses**
Ref	Expression
lcfrlem38.h	⊢ 𝐻 = (LHyp‘𝐾)
lcfrlem38.o	⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
lcfrlem38.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
lcfrlem38.p	⊢ + = (+_g‘𝑈)
lcfrlem38.f	⊢ 𝐹 = (LFnl‘𝑈)
lcfrlem38.l	⊢ 𝐿 = (LKer‘𝑈)
lcfrlem38.d	⊢ 𝐷 = (LDual‘𝑈)
lcfrlem38.q	⊢ 𝑄 = (LSubSp‘𝐷)
lcfrlem38.c	⊢ 𝐶 = {𝑓 ∈ (LFnl‘𝑈) ∣ ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓)}
lcfrlem38.e	⊢ 𝐸 = ∪ 𝑔 ∈ 𝐺 ( ⊥ ‘(𝐿‘𝑔))
lcfrlem38.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
lcfrlem38.g	⊢ (𝜑 → 𝐺 ∈ 𝑄)
lcfrlem38.gs	⊢ (𝜑 → 𝐺 ⊆ 𝐶)
lcfrlem38.xe	⊢ (𝜑 → 𝑋 ∈ 𝐸)
lcfrlem38.ye	⊢ (𝜑 → 𝑌 ∈ 𝐸)
lcfrlem38.z	⊢ 0 = (0_g‘𝑈)
lcfrlem38.x	⊢ (𝜑 → 𝑋 ≠ 0 )
lcfrlem38.y	⊢ (𝜑 → 𝑌 ≠ 0 )
lcfrlem38.sp	⊢ 𝑁 = (LSpan‘𝑈)
lcfrlem38.ne	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))

**Assertion**
Ref	Expression
lcfrlem40	⊢ (𝜑 → (𝑋 + 𝑌) ∈ 𝐸)

Distinct variable groups: 𝐷,𝑔 𝑔,𝐺 𝑓,𝑔,𝐿 ⊥ ,𝑓,𝑔 + ,𝑓,𝑔 𝑈,𝑓,𝑔 𝑓,𝑋,𝑔 𝑓,𝑌,𝑔 0 ,𝑓,𝑔 𝜑,𝑔 𝑔,𝑁 Allowed substitution hints: 𝜑(𝑓) 𝐶(𝑓,𝑔) 𝐷(𝑓) 𝑄(𝑓,𝑔) 𝐸(𝑓,𝑔) 𝐹(𝑓,𝑔) 𝐺(𝑓) 𝐻(𝑓,𝑔) 𝐾(𝑓,𝑔) 𝑁(𝑓) 𝑊(𝑓,𝑔)

Proof of Theorem lcfrlem40 Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lcfrlem38.z	. . 3 ⊢ 0 = (0_g‘𝑈)
2		eqid 2730	. . 3 ⊢ (LSAtoms‘𝑈) = (LSAtoms‘𝑈)
3		lcfrlem38.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
4		lcfrlem38.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
5		lcfrlem38.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6	3, 4, 5	dvhlmod 41099	. . 3 ⊢ (𝜑 → 𝑈 ∈ LMod)
7		lcfrlem38.o	. . . 4 ⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
8		eqid 2730	. . . 4 ⊢ (Base‘𝑈) = (Base‘𝑈)
9		lcfrlem38.p	. . . 4 ⊢ + = (+_g‘𝑈)
10		lcfrlem38.sp	. . . 4 ⊢ 𝑁 = (LSpan‘𝑈)
11		lcfrlem38.l	. . . . . 6 ⊢ 𝐿 = (LKer‘𝑈)
12		lcfrlem38.d	. . . . . 6 ⊢ 𝐷 = (LDual‘𝑈)
13		lcfrlem38.q	. . . . . 6 ⊢ 𝑄 = (LSubSp‘𝐷)
14		lcfrlem38.e	. . . . . 6 ⊢ 𝐸 = ∪ 𝑔 ∈ 𝐺 ( ⊥ ‘(𝐿‘𝑔))
15		lcfrlem38.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ 𝑄)
16		lcfrlem38.xe	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐸)
17	3, 7, 4, 8, 11, 12, 13, 14, 5, 15, 16	lcfrlem4 41534	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑈))
18		lcfrlem38.x	. . . . 5 ⊢ (𝜑 → 𝑋 ≠ 0 )
19		eldifsn 4752	. . . . 5 ⊢ (𝑋 ∈ ((Base‘𝑈) ∖ { 0 }) ↔ (𝑋 ∈ (Base‘𝑈) ∧ 𝑋 ≠ 0 ))
20	17, 18, 19	sylanbrc 583	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ((Base‘𝑈) ∖ { 0 }))
21		lcfrlem38.ye	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐸)
22	3, 7, 4, 8, 11, 12, 13, 14, 5, 15, 21	lcfrlem4 41534	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝑈))
23		lcfrlem38.y	. . . . 5 ⊢ (𝜑 → 𝑌 ≠ 0 )
24		eldifsn 4752	. . . . 5 ⊢ (𝑌 ∈ ((Base‘𝑈) ∖ { 0 }) ↔ (𝑌 ∈ (Base‘𝑈) ∧ 𝑌 ≠ 0 ))
25	22, 23, 24	sylanbrc 583	. . . 4 ⊢ (𝜑 → 𝑌 ∈ ((Base‘𝑈) ∖ { 0 }))
26		lcfrlem38.ne	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
27	3, 7, 4, 8, 9, 1, 10, 2, 5, 20, 25, 26	lcfrlem21 41552	. . 3 ⊢ (𝜑 → ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∈ (LSAtoms‘𝑈))
28	1, 2, 6, 27	lsateln0 38983	. 2 ⊢ (𝜑 → ∃𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)}))𝑖 ≠ 0 )
29		lcfrlem38.f	. . . 4 ⊢ 𝐹 = (LFnl‘𝑈)
30		lcfrlem38.c	. . . 4 ⊢ 𝐶 = {𝑓 ∈ (LFnl‘𝑈) ∣ ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓)}
31	5	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
32	15	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝐺 ∈ 𝑄)
33		lcfrlem38.gs	. . . . 5 ⊢ (𝜑 → 𝐺 ⊆ 𝐶)
34	33	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝐺 ⊆ 𝐶)
35	16	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝑋 ∈ 𝐸)
36	21	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝑌 ∈ 𝐸)
37	18	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝑋 ≠ 0 )
38	23	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝑌 ≠ 0 )
39	26	3ad2ant1 1133	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
40		eqid 2730	. . . 4 ⊢ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) = ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)}))
41		simp2 1137	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})))
42		simp3 1138	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → 𝑖 ≠ 0 )
43	3, 7, 4, 9, 29, 11, 12, 13, 30, 14, 31, 32, 34, 35, 36, 1, 37, 38, 10, 39, 40, 41, 42	lcfrlem39 41570	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → (𝑋 + 𝑌) ∈ 𝐸)
44	43	rexlimdv3a 3139	. 2 ⊢ (𝜑 → (∃𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)}))𝑖 ≠ 0 → (𝑋 + 𝑌) ∈ 𝐸))
45	28, 44	mpd 15	1 ⊢ (𝜑 → (𝑋 + 𝑌) ∈ 𝐸)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∃wrex 3054 {crab 3408 ∖ cdif 3913 ∩ cin 3915 ⊆ wss 3916 {csn 4591 {cpr 4593 ∪ ciun 4957 ‘cfv 6513 (class class class)co 7389 Basecbs 17185 +_gcplusg 17226 0_gc0g 17408 LSubSpclss 20843 LSpanclspn 20883 LSAtomsclsa 38962 LFnlclfn 39045 LKerclk 39073 LDualcld 39111 HLchlt 39338 LHypclh 39973 DVecHcdvh 41067 ocHcoch 41336

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 ax-riotaBAD 38941

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4874 df-int 4913 df-iun 4959 df-iin 4960 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-of 7655 df-om 7845 df-1st 7970 df-2nd 7971 df-tpos 8207 df-undef 8254 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-1o 8436 df-2o 8437 df-er 8673 df-map 8803 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-nn 12188 df-2 12250 df-3 12251 df-4 12252 df-5 12253 df-6 12254 df-n0 12449 df-z 12536 df-uz 12800 df-fz 13475 df-struct 17123 df-sets 17140 df-slot 17158 df-ndx 17170 df-base 17186 df-ress 17207 df-plusg 17239 df-mulr 17240 df-sca 17242 df-vsca 17243 df-0g 17410 df-mre 17553 df-mrc 17554 df-acs 17556 df-proset 18261 df-poset 18280 df-plt 18295 df-lub 18311 df-glb 18312 df-join 18313 df-meet 18314 df-p0 18390 df-p1 18391 df-lat 18397 df-clat 18464 df-mgm 18573 df-sgrp 18652 df-mnd 18668 df-submnd 18717 df-grp 18874 df-minusg 18875 df-sbg 18876 df-subg 19061 df-cntz 19255 df-oppg 19284 df-lsm 19572 df-cmn 19718 df-abl 19719 df-mgp 20056 df-rng 20068 df-ur 20097 df-ring 20150 df-oppr 20252 df-dvdsr 20272 df-unit 20273 df-invr 20303 df-dvr 20316 df-nzr 20428 df-rlreg 20609 df-domn 20610 df-drng 20646 df-lmod 20774 df-lss 20844 df-lsp 20884 df-lvec 21016 df-lsatoms 38964 df-lshyp 38965 df-lcv 39007 df-lfl 39046 df-lkr 39074 df-ldual 39112 df-oposet 39164 df-ol 39166 df-oml 39167 df-covers 39254 df-ats 39255 df-atl 39286 df-cvlat 39310 df-hlat 39339 df-llines 39487 df-lplanes 39488 df-lvols 39489 df-lines 39490 df-psubsp 39492 df-pmap 39493 df-padd 39785 df-lhyp 39977 df-laut 39978 df-ldil 40093 df-ltrn 40094 df-trl 40148 df-tgrp 40732 df-tendo 40744 df-edring 40746 df-dveca 40992 df-disoa 41018 df-dvech 41068 df-dib 41128 df-dic 41162 df-dih 41218 df-doch 41337 df-djh 41384

This theorem is referenced by: lcfrlem41 41572

W3C validator