| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemefr45 | Structured version Visualization version GIF version | ||
| Description: Value of f(r) when r is an atom not under pq, using very compact hypotheses. TODO: FIX COMMENT. (Contributed by NM, 1-Apr-2013.) |
| Ref | Expression |
|---|---|
| cdlemef45.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemef45.l | ⊢ ≤ = (le‘𝐾) |
| cdlemef45.j | ⊢ ∨ = (join‘𝐾) |
| cdlemef45.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemef45.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemef45.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemef45.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdlemef45.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
| cdlemef45.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
| Ref | Expression |
|---|---|
| cdlemefr45 | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝐹‘𝑅) = ⦋𝑅 / 𝑡⦌𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemef45.b | . 2 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemef45.l | . 2 ⊢ ≤ = (le‘𝐾) | |
| 3 | cdlemef45.j | . 2 ⊢ ∨ = (join‘𝐾) | |
| 4 | cdlemef45.m | . 2 ⊢ ∧ = (meet‘𝐾) | |
| 5 | cdlemef45.a | . 2 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemef45.h | . 2 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemef45.u | . 2 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 8 | cdlemef45.d | . 2 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
| 9 | eqid 2752 | . 2 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) | |
| 10 | cdlemef45.f | . 2 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdlemefr44 40987 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝐹‘𝑅) = ⦋𝑅 / 𝑡⦌𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1095 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 ∀wral 3066 ⦋csb 3843 ifcif 4470 class class class wbr 5090 ↦ cmpt 5171 ‘cfv 6506 ℩crio 7337 (class class class)co 7381 Basecbs 17217 lecple 17265 joincjn 18315 meetcmee 18316 Atomscatm 39825 HLchlt 39912 LHypclh 40546 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-iin 4942 df-br 5091 df-opab 5153 df-mpt 5172 df-id 5531 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-1st 7955 df-2nd 7956 df-proset 18298 df-poset 18317 df-plt 18332 df-lub 18348 df-glb 18349 df-join 18350 df-meet 18351 df-p0 18427 df-p1 18428 df-lat 18436 df-clat 18503 df-oposet 39738 df-ol 39740 df-oml 39741 df-covers 39828 df-ats 39829 df-atl 39860 df-cvlat 39884 df-hlat 39913 df-lines 40063 df-psubsp 40065 df-pmap 40066 df-padd 40358 df-lhyp 40550 |
| This theorem is referenced by: cdlemefr45e 40990 cdlemeg47b 41070 cdlemeg46c 41075 |
| Copyright terms: Public domain | W3C validator |