Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg1a | Structured version Visualization version GIF version |
Description: Shorter expression for 𝐺. TODO: fix comment. TODO: shorten using cdleme 37690 or vice-versa? Also, if not shortened with cdleme 37690, then it can be moved up to save repeating hypotheses. (Contributed by NM, 15-Apr-2013.) |
Ref | Expression |
---|---|
cdlemg1.b | ⊢ 𝐵 = (Base‘𝐾) |
cdlemg1.l | ⊢ ≤ = (le‘𝐾) |
cdlemg1.j | ⊢ ∨ = (join‘𝐾) |
cdlemg1.m | ⊢ ∧ = (meet‘𝐾) |
cdlemg1.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemg1.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemg1.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
cdlemg1.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
cdlemg1.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
cdlemg1.g | ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
cdlemg1.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
Ref | Expression |
---|---|
cdlemg1a | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐺 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = 𝑄)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdlemg1.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
2 | cdlemg1.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
3 | cdlemg1.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
4 | cdlemg1.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
5 | cdlemg1.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
6 | cdlemg1.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
7 | cdlemg1.u | . . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
8 | cdlemg1.d | . . . 4 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
9 | cdlemg1.e | . . . 4 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
10 | cdlemg1.g | . . . 4 ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
11 | cdlemg1.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | cdleme50ltrn 37687 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐺 ∈ 𝑇) |
13 | simpll1 1208 | . . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
14 | simplr 767 | . . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → 𝑓 ∈ 𝑇) | |
15 | 12 | ad2antrr 724 | . . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → 𝐺 ∈ 𝑇) |
16 | simpll2 1209 | . . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
17 | simpr 487 | . . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → (𝑓‘𝑃) = 𝑄) | |
18 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdleme17d 37628 | . . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐺‘𝑃) = 𝑄) |
19 | 18 | ad2antrr 724 | . . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → (𝐺‘𝑃) = 𝑄) |
20 | 17, 19 | eqtr4d 2859 | . . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → (𝑓‘𝑃) = (𝐺‘𝑃)) |
21 | 2, 5, 6, 11 | cdlemd 37337 | . . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑓 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑓‘𝑃) = (𝐺‘𝑃)) → 𝑓 = 𝐺) |
22 | 13, 14, 15, 16, 20, 21 | syl311anc 1380 | . . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) ∧ (𝑓‘𝑃) = 𝑄) → 𝑓 = 𝐺) |
23 | 22 | ex 415 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → ((𝑓‘𝑃) = 𝑄 → 𝑓 = 𝐺)) |
24 | 18 | adantr 483 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝐺‘𝑃) = 𝑄) |
25 | fveq1 6664 | . . . . . 6 ⊢ (𝑓 = 𝐺 → (𝑓‘𝑃) = (𝐺‘𝑃)) | |
26 | 25 | eqeq1d 2823 | . . . . 5 ⊢ (𝑓 = 𝐺 → ((𝑓‘𝑃) = 𝑄 ↔ (𝐺‘𝑃) = 𝑄)) |
27 | 24, 26 | syl5ibrcom 249 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → (𝑓 = 𝐺 → (𝑓‘𝑃) = 𝑄)) |
28 | 23, 27 | impbid 214 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑓 ∈ 𝑇) → ((𝑓‘𝑃) = 𝑄 ↔ 𝑓 = 𝐺)) |
29 | 12, 28 | riota5 7137 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = 𝑄) = 𝐺) |
30 | 29 | eqcomd 2827 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐺 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = 𝑄)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∀wral 3138 ⦋csb 3883 ifcif 4467 class class class wbr 5059 ↦ cmpt 5139 ‘cfv 6350 ℩crio 7107 (class class class)co 7150 Basecbs 16477 lecple 16566 joincjn 17548 meetcmee 17549 Atomscatm 36393 HLchlt 36480 LHypclh 37114 LTrncltrn 37231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-riotaBAD 36083 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-iun 4914 df-iin 4915 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-1st 7683 df-2nd 7684 df-undef 7933 df-map 8402 df-proset 17532 df-poset 17550 df-plt 17562 df-lub 17578 df-glb 17579 df-join 17580 df-meet 17581 df-p0 17643 df-p1 17644 df-lat 17650 df-clat 17712 df-oposet 36306 df-ol 36308 df-oml 36309 df-covers 36396 df-ats 36397 df-atl 36428 df-cvlat 36452 df-hlat 36481 df-llines 36628 df-lplanes 36629 df-lvols 36630 df-lines 36631 df-psubsp 36633 df-pmap 36634 df-padd 36926 df-lhyp 37118 df-laut 37119 df-ldil 37234 df-ltrn 37235 df-trl 37289 |
This theorem is referenced by: cdlemg1b2 37701 |
Copyright terms: Public domain | W3C validator |