cdlemk39u1 - Mathbox for Norm Megill

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

Theorem cdlemk39u1 41166

Description: Lemma for cdlemk39u 41167. (Contributed by NM, 31-Jul-2013.)

**Hypotheses**
Ref	Expression
cdlemk5.b	⊢ 𝐵 = (Base‘𝐾)
cdlemk5.l	⊢ ≤ = (le‘𝐾)
cdlemk5.j	⊢ ∨ = (join‘𝐾)
cdlemk5.m	⊢ ∧ = (meet‘𝐾)
cdlemk5.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemk5.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemk5.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk5.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk5.z	⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))))
cdlemk5.y	⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ^◡𝑏))))
cdlemk5.x	⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌))
cdlemk5.u	⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋))

**Assertion**
Ref	Expression
cdlemk39u1	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑈‘𝐺)) ≤ (𝑅‘𝐺))

Distinct variable groups: ∧ ,𝑔 ∨ ,𝑔 𝐵,𝑔 𝑃,𝑔 𝑅,𝑔 𝑇,𝑔 𝑔,𝑍 𝑔,𝑏,𝐺,𝑧 ∧ ,𝑏,𝑧 ≤ ,𝑏 𝑧,𝑔, ≤ ∨ ,𝑏,𝑧 𝐴,𝑏,𝑔,𝑧 𝐵,𝑏,𝑧 𝐹,𝑏,𝑔,𝑧 𝑧,𝐺 𝐻,𝑏,𝑔,𝑧 𝐾,𝑏,𝑔,𝑧 𝑁,𝑏,𝑔,𝑧 𝑃,𝑏,𝑧 𝑅,𝑏,𝑧 𝑇,𝑏,𝑧 𝑊,𝑏,𝑔,𝑧 𝑧,𝑌 𝐺,𝑏 Allowed substitution hints: 𝑈(𝑧,𝑔,𝑏) 𝑋(𝑧,𝑔,𝑏) 𝑌(𝑔,𝑏) 𝑍(𝑧,𝑏)

**Proof of Theorem cdlemk39u1**
Step	Hyp	Ref	Expression
1		simp22 1208	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ≠ 𝑁)
2		simp23 1209	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
3		cdlemk5.x	. . . . 5 ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌))
4		cdlemk5.u	. . . . 5 ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋))
5	3, 4	cdlemk40f 41118	. . . 4 ⊢ ((𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) → (𝑈‘𝐺) = ⦋𝐺 / 𝑔⦌𝑋)
6	1, 2, 5	syl2anc 584	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘𝐺) = ⦋𝐺 / 𝑔⦌𝑋)
7	6	fveq2d 6836	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑈‘𝐺)) = (𝑅‘⦋𝐺 / 𝑔⦌𝑋))
8		simp11 1204	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
9		simp12 1205	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
10		simp13 1206	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑁 ∈ 𝑇)
11		simp21 1207	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = (𝑅‘𝑁))
12		cdlemk5.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
13		cdlemk5.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
14		cdlemk5.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
15		cdlemk5.r	. . . . . 6 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
16	12, 13, 14, 15	trlnid 40378	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝐹 ≠ 𝑁 ∧ (𝑅‘𝐹) = (𝑅‘𝑁))) → 𝐹 ≠ ( I ↾ 𝐵))
17	8, 9, 10, 1, 11, 16	syl122anc 1381	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ≠ ( I ↾ 𝐵))
18	9, 17	jca 511	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)))
19		simp3 1138	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
20		cdlemk5.l	. . . 4 ⊢ ≤ = (le‘𝐾)
21		cdlemk5.j	. . . 4 ⊢ ∨ = (join‘𝐾)
22		cdlemk5.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
23		cdlemk5.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
24		cdlemk5.z	. . . 4 ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))))
25		cdlemk5.y	. . . 4 ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ^◡𝑏))))
26	12, 20, 21, 22, 23, 13, 14, 15, 24, 25, 3	cdlemk39s-id 41139	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ 𝐺 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁))) → (𝑅‘⦋𝐺 / 𝑔⦌𝑋) ≤ (𝑅‘𝐺))
27	8, 18, 2, 10, 19, 11, 26	syl132anc 1390	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘⦋𝐺 / 𝑔⦌𝑋) ≤ (𝑅‘𝐺))
28	7, 27	eqbrtrd 5118	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑈‘𝐺)) ≤ (𝑅‘𝐺))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 ⦋csb 3847 ifcif 4477 class class class wbr 5096 ↦ cmpt 5177 I cid 5516 ^◡ccnv 5621 ↾ cres 5624 ∘ ccom 5626 ‘cfv 6490 ℩crio 7312 (class class class)co 7356 Basecbs 17134 lecple 17182 joincjn 18232 meetcmee 18233 Atomscatm 39462 HLchlt 39549 LHypclh 40183 LTrncltrn 40300 trLctrl 40357

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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-riotaBAD 39152

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 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-iin 4947 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-undef 8213 df-map 8763 df-proset 18215 df-poset 18234 df-plt 18249 df-lub 18265 df-glb 18266 df-join 18267 df-meet 18268 df-p0 18344 df-p1 18345 df-lat 18353 df-clat 18420 df-oposet 39375 df-ol 39377 df-oml 39378 df-covers 39465 df-ats 39466 df-atl 39497 df-cvlat 39521 df-hlat 39550 df-llines 39697 df-lplanes 39698 df-lvols 39699 df-lines 39700 df-psubsp 39702 df-pmap 39703 df-padd 39995 df-lhyp 40187 df-laut 40188 df-ldil 40303 df-ltrn 40304 df-trl 40358

This theorem is referenced by: cdlemk39u 41167

W3C validator