![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemeg49le | Structured version Visualization version GIF version |
Description: Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 9-Apr-2013.) |
Ref | Expression |
---|---|
cdlemef47.b | ⊢ 𝐵 = (Base‘𝐾) |
cdlemef47.l | ⊢ ≤ = (le‘𝐾) |
cdlemef47.j | ⊢ ∨ = (join‘𝐾) |
cdlemef47.m | ⊢ ∧ = (meet‘𝐾) |
cdlemef47.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemef47.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemef47.v | ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊) |
cdlemef47.n | ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) |
cdlemefs47.o | ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))) |
cdlemef47.g | ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) |
Ref | Expression |
---|---|
cdlemeg49le | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝐺‘𝑋) ≤ (𝐺‘𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp11 1203 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
2 | simp13 1205 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) | |
3 | simp12 1204 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
4 | simp2 1137 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) | |
5 | simp3 1138 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑋 ≤ 𝑌) | |
6 | cdlemef47.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
7 | cdlemef47.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
8 | cdlemef47.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
9 | cdlemef47.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
10 | cdlemef47.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
11 | cdlemef47.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
12 | cdlemef47.v | . . 3 ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊) | |
13 | vex 3449 | . . . 4 ⊢ 𝑢 ∈ V | |
14 | cdlemef47.n | . . . . 5 ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) | |
15 | eqid 2736 | . . . . 5 ⊢ ((𝑢 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑢) ∧ 𝑊))) = ((𝑢 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑢) ∧ 𝑊))) | |
16 | 14, 15 | cdleme31sc 38837 | . . . 4 ⊢ (𝑢 ∈ V → ⦋𝑢 / 𝑣⦌𝑁 = ((𝑢 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑢) ∧ 𝑊)))) |
17 | 13, 16 | ax-mp 5 | . . 3 ⊢ ⦋𝑢 / 𝑣⦌𝑁 = ((𝑢 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑢) ∧ 𝑊))) |
18 | cdlemefs47.o | . . 3 ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))) | |
19 | eqid 2736 | . . 3 ⊢ (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)) = (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)) | |
20 | eqid 2736 | . . 3 ⊢ if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) = if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) | |
21 | eqid 2736 | . . 3 ⊢ (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))) = (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))) | |
22 | cdlemef47.g | . . 3 ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) | |
23 | 6, 7, 8, 9, 10, 11, 12, 17, 14, 18, 19, 20, 21, 22 | cdleme32le 38900 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝐺‘𝑋) ≤ (𝐺‘𝑌)) |
24 | 1, 2, 3, 4, 5, 23 | syl311anc 1384 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝐺‘𝑋) ≤ (𝐺‘𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 Vcvv 3445 ⦋csb 3855 ifcif 4486 class class class wbr 5105 ↦ cmpt 5188 ‘cfv 6496 ℩crio 7311 (class class class)co 7356 Basecbs 17082 lecple 17139 joincjn 18199 meetcmee 18200 Atomscatm 37715 HLchlt 37802 LHypclh 38437 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 ax-riotaBAD 37405 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-iin 4957 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7312 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7920 df-2nd 7921 df-undef 8203 df-proset 18183 df-poset 18201 df-plt 18218 df-lub 18234 df-glb 18235 df-join 18236 df-meet 18237 df-p0 18313 df-p1 18314 df-lat 18320 df-clat 18387 df-oposet 37628 df-ol 37630 df-oml 37631 df-covers 37718 df-ats 37719 df-atl 37750 df-cvlat 37774 df-hlat 37803 df-llines 37951 df-lplanes 37952 df-lvols 37953 df-lines 37954 df-psubsp 37956 df-pmap 37957 df-padd 38249 df-lhyp 38441 |
This theorem is referenced by: cdlemeg49lebilem 38992 |
Copyright terms: Public domain | W3C validator |