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 41620

Description: Lemma for lcfr 41623. 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 2731	. . 3 ⊢ (LSAtoms‘𝑈) = (LSAtoms‘𝑈)
3		lcfrlem38.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
4		lcfrlem38.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
5		lcfrlem38.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6	3, 4, 5	dvhlmod 41148	. . 3 ⊢ (𝜑 → 𝑈 ∈ LMod)
7		lcfrlem38.o	. . . 4 ⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
8		eqid 2731	. . . 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 41583	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑈))
18		lcfrlem38.x	. . . . 5 ⊢ (𝜑 → 𝑋 ≠ 0 )
19		eldifsn 4738	. . . . 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 41583	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝑈))
23		lcfrlem38.y	. . . . 5 ⊢ (𝜑 → 𝑌 ≠ 0 )
24		eldifsn 4738	. . . . 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 41601	. . 3 ⊢ (𝜑 → ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∈ (LSAtoms‘𝑈))
28	1, 2, 6, 27	lsateln0 39033	. 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 2731	. . . 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 41619	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)})) ∧ 𝑖 ≠ 0 ) → (𝑋 + 𝑌) ∈ 𝐸)
44	43	rexlimdv3a 3137	. 2 ⊢ (𝜑 → (∃𝑖 ∈ ((𝑁‘{𝑋, 𝑌}) ∩ ( ⊥ ‘{(𝑋 + 𝑌)}))𝑖 ≠ 0 → (𝑋 + 𝑌) ∈ 𝐸))
45	28, 44	mpd 15	1 ⊢ (𝜑 → (𝑋 + 𝑌) ∈ 𝐸)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ∃wrex 3056 {crab 3395 ∖ cdif 3899 ∩ cin 3901 ⊆ wss 3902 {csn 4576 {cpr 4578 ∪ ciun 4941 ‘cfv 6481 (class class class)co 7346 Basecbs 17117 +_gcplusg 17158 0_gc0g 17340 LSubSpclss 20862 LSpanclspn 20902 LSAtomsclsa 39012 LFnlclfn 39095 LKerclk 39123 LDualcld 39161 HLchlt 39388 LHypclh 40022 DVecHcdvh 41116 ocHcoch 41385

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 ax-riotaBAD 38991

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-uni 4860 df-int 4898 df-iun 4943 df-iin 4944 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-of 7610 df-om 7797 df-1st 7921 df-2nd 7922 df-tpos 8156 df-undef 8203 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-2o 8386 df-er 8622 df-map 8752 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-nn 12123 df-2 12185 df-3 12186 df-4 12187 df-5 12188 df-6 12189 df-n0 12379 df-z 12466 df-uz 12730 df-fz 13405 df-struct 17055 df-sets 17072 df-slot 17090 df-ndx 17102 df-base 17118 df-ress 17139 df-plusg 17171 df-mulr 17172 df-sca 17174 df-vsca 17175 df-0g 17342 df-mre 17485 df-mrc 17486 df-acs 17488 df-proset 18197 df-poset 18216 df-plt 18231 df-lub 18247 df-glb 18248 df-join 18249 df-meet 18250 df-p0 18326 df-p1 18327 df-lat 18335 df-clat 18402 df-mgm 18545 df-sgrp 18624 df-mnd 18640 df-submnd 18689 df-grp 18846 df-minusg 18847 df-sbg 18848 df-subg 19033 df-cntz 19227 df-oppg 19256 df-lsm 19546 df-cmn 19692 df-abl 19693 df-mgp 20057 df-rng 20069 df-ur 20098 df-ring 20151 df-oppr 20253 df-dvdsr 20273 df-unit 20274 df-invr 20304 df-dvr 20317 df-nzr 20426 df-rlreg 20607 df-domn 20608 df-drng 20644 df-lmod 20793 df-lss 20863 df-lsp 20903 df-lvec 21035 df-lsatoms 39014 df-lshyp 39015 df-lcv 39057 df-lfl 39096 df-lkr 39124 df-ldual 39162 df-oposet 39214 df-ol 39216 df-oml 39217 df-covers 39304 df-ats 39305 df-atl 39336 df-cvlat 39360 df-hlat 39389 df-llines 39536 df-lplanes 39537 df-lvols 39538 df-lines 39539 df-psubsp 39541 df-pmap 39542 df-padd 39834 df-lhyp 40026 df-laut 40027 df-ldil 40142 df-ltrn 40143 df-trl 40197 df-tgrp 40781 df-tendo 40793 df-edring 40795 df-dveca 41041 df-disoa 41067 df-dvech 41117 df-dib 41177 df-dic 41211 df-dih 41267 df-doch 41386 df-djh 41433

This theorem is referenced by: lcfrlem41 41621

W3C validator