| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg2klem | Structured version Visualization version GIF version | ||
| Description: cdleme42keg 41367 with simpler hypotheses. TODO: FIX COMMENT. (Contributed by NM, 22-Apr-2013.) |
| Ref | Expression |
|---|---|
| cdlemg2.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemg2.l | ⊢ ≤ = (le‘𝐾) |
| cdlemg2.j | ⊢ ∨ = (join‘𝐾) |
| cdlemg2.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemg2.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemg2.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemg2.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| cdlemg2ex.u | ⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊) |
| cdlemg2ex.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊))) |
| cdlemg2ex.e | ⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
| cdlemg2ex.g | ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
| cdlemg2klem.v | ⊢ 𝑉 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| Ref | Expression |
|---|---|
| cdlemg2klem | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemg2.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemg2.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | cdlemg2.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 4 | cdlemg2.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 5 | cdlemg2.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemg2.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemg2.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 8 | cdlemg2ex.u | . . 3 ⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊) | |
| 9 | cdlemg2ex.d | . . 3 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊))) | |
| 10 | cdlemg2ex.e | . . 3 ⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
| 11 | cdlemg2ex.g | . . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
| 12 | fveq1 6881 | . . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑃) = (𝐺‘𝑃)) | |
| 13 | fveq1 6881 | . . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑄) = (𝐺‘𝑄)) | |
| 14 | 12, 13 | oveq12d 7435 | . . . 4 ⊢ (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) |
| 15 | 12 | oveq1d 7432 | . . . 4 ⊢ (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ 𝑉) = ((𝐺‘𝑃) ∨ 𝑉)) |
| 16 | 14, 15 | eqeq12d 2778 | . . 3 ⊢ (𝐹 = 𝐺 → (((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ 𝑉) ↔ ((𝐺‘𝑃) ∨ (𝐺‘𝑄)) = ((𝐺‘𝑃) ∨ 𝑉))) |
| 17 | vex 3457 | . . . . 5 ⊢ 𝑠 ∈ V | |
| 18 | eqid 2762 | . . . . . 6 ⊢ ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) | |
| 19 | 9, 18 | cdleme31sc 41265 | . . . . 5 ⊢ (𝑠 ∈ V → ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊)))) |
| 20 | 17, 19 | ax-mp 5 | . . . 4 ⊢ ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) |
| 21 | eqid 2762 | . . . 4 ⊢ (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) | |
| 22 | eqid 2762 | . . . 4 ⊢ if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) = if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) | |
| 23 | eqid 2762 | . . . 4 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) | |
| 24 | cdlemg2klem.v | . . . 4 ⊢ 𝑉 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 25 | 1, 2, 3, 4, 5, 6, 8, 20, 9, 10, 21, 22, 23, 11, 24 | cdleme42keg 41367 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝐺‘𝑃) ∨ (𝐺‘𝑄)) = ((𝐺‘𝑃) ∨ 𝑉)) |
| 26 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 16, 25 | cdlemg2ce 41473 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ 𝑉)) |
| 27 | 26 | 3com23 1144 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ 𝑉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∀wral 3078 Vcvv 3453 ⦋csb 3850 ifcif 4485 class class class wbr 5107 ↦ cmpt 5190 ‘cfv 6537 ℩crio 7373 (class class class)co 7417 Basecbs 17307 lecple 17355 joincjn 18405 meetcmee 18406 Atomscatm 40144 HLchlt 40231 LHypclh 40865 LTrncltrn 40982 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-riotaBAD 39834 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-undef 8275 df-map 8832 df-proset 18388 df-poset 18407 df-plt 18422 df-lub 18438 df-glb 18439 df-join 18440 df-meet 18441 df-p0 18517 df-p1 18518 df-lat 18526 df-clat 18593 df-oposet 40057 df-ol 40059 df-oml 40060 df-covers 40147 df-ats 40148 df-atl 40179 df-cvlat 40203 df-hlat 40232 df-llines 40379 df-lplanes 40380 df-lvols 40381 df-lines 40382 df-psubsp 40384 df-pmap 40385 df-padd 40677 df-lhyp 40869 df-laut 40870 df-ldil 40985 df-ltrn 40986 df-trl 41040 |
| This theorem is used by: cdlemg2k 41482 |
| Copyright terms: Public domain | W3C validator |