![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme32sn1awN | Structured version Visualization version GIF version |
Description: Show that ⦋𝑅 / 𝑠⦌𝑁 is an atom not under 𝑊 when 𝑅 ≤ (𝑃 ∨ 𝑄). (Contributed by NM, 6-Mar-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cdleme32.b | ⊢ 𝐵 = (Base‘𝐾) |
cdleme32.l | ⊢ ≤ = (le‘𝐾) |
cdleme32.j | ⊢ ∨ = (join‘𝐾) |
cdleme32.m | ⊢ ∧ = (meet‘𝐾) |
cdleme32.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdleme32.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdleme32.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
cdleme32.c | ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) |
cdleme32.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
cdleme32.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
cdleme32.i | ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)) |
cdleme32.n | ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) |
cdleme32a1.y | ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) |
cdleme32a1.z | ⊢ 𝑍 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝑌)) |
Ref | Expression |
---|---|
cdleme32sn1awN | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐴 ∧ ¬ ⦋𝑅 / 𝑠⦌𝑁 ≤ 𝑊)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdleme32.b | . 2 ⊢ 𝐵 = (Base‘𝐾) | |
2 | cdleme32.l | . 2 ⊢ ≤ = (le‘𝐾) | |
3 | cdleme32.j | . 2 ⊢ ∨ = (join‘𝐾) | |
4 | cdleme32.m | . 2 ⊢ ∧ = (meet‘𝐾) | |
5 | cdleme32.a | . 2 ⊢ 𝐴 = (Atoms‘𝐾) | |
6 | cdleme32.h | . 2 ⊢ 𝐻 = (LHyp‘𝐾) | |
7 | cdleme32.u | . 2 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
8 | cdleme32.d | . 2 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
9 | cdleme32.e | . 2 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
10 | cdleme32.i | . 2 ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)) | |
11 | cdleme32.n | . 2 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) | |
12 | cdleme32a1.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) | |
13 | cdleme32a1.z | . 2 ⊢ 𝑍 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝑌)) | |
14 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 | cdlemefs32sn1aw 39779 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐴 ∧ ¬ ⦋𝑅 / 𝑠⦌𝑁 ≤ 𝑊)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2932 ∀wral 3053 ⦋csb 3886 ifcif 4521 class class class wbr 5139 ‘cfv 6534 ℩crio 7357 (class class class)co 7402 Basecbs 17145 lecple 17205 joincjn 18268 meetcmee 18269 Atomscatm 38627 HLchlt 38714 LHypclh 39349 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5276 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-riotaBAD 38317 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-iin 4991 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-1st 7969 df-2nd 7970 df-undef 8254 df-proset 18252 df-poset 18270 df-plt 18287 df-lub 18303 df-glb 18304 df-join 18305 df-meet 18306 df-p0 18382 df-p1 18383 df-lat 18389 df-clat 18456 df-oposet 38540 df-ol 38542 df-oml 38543 df-covers 38630 df-ats 38631 df-atl 38662 df-cvlat 38686 df-hlat 38715 df-llines 38863 df-lplanes 38864 df-lvols 38865 df-lines 38866 df-psubsp 38868 df-pmap 38869 df-padd 39161 df-lhyp 39353 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |