![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg2jlemOLDN | Structured version Visualization version GIF version |
Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: FIX COMMENT. f preserves join: f(r ∨ s) = f(r) ∨ s, p. 115 10th line from bottom. TODO: Combine with cdlemg2jOLDN 40593? (Contributed by NM, 22-Apr-2013.) (New usage is discouraged.) |
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(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
Ref | Expression |
---|---|
cdlemg2jlemOLDN | ⊢ (((𝐾 ∈ 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 6910 | . . . 4 ⊢ (𝐹 = 𝐺 → (𝐹‘(𝑃 ∨ 𝑄)) = (𝐺‘(𝑃 ∨ 𝑄))) | |
13 | fveq1 6910 | . . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑃) = (𝐺‘𝑃)) | |
14 | fveq1 6910 | . . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑄) = (𝐺‘𝑄)) | |
15 | 13, 14 | oveq12d 7453 | . . . 4 ⊢ (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) |
16 | 12, 15 | eqeq12d 2752 | . . 3 ⊢ (𝐹 = 𝐺 → ((𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) ↔ (𝐺‘(𝑃 ∨ 𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))) |
17 | vex 3483 | . . . . 5 ⊢ 𝑠 ∈ V | |
18 | eqid 2736 | . . . . . 6 ⊢ ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) | |
19 | 9, 18 | cdleme31sc 40379 | . . . . 5 ⊢ (𝑠 ∈ V → ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊)))) |
20 | 17, 19 | ax-mp 5 | . . . 4 ⊢ ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) |
21 | eqid 2736 | . . . 4 ⊢ (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) | |
22 | eqid 2736 | . . . 4 ⊢ if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) = if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) | |
23 | eqid 2736 | . . . 4 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) | |
24 | 1, 2, 3, 4, 5, 6, 8, 20, 9, 10, 21, 22, 23, 11 | cdleme42mgN 40483 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐺‘(𝑃 ∨ 𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) |
25 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 16, 24 | cdlemg2ce 40587 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄))) |
26 | 25 | 3com23 1126 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1538 ∈ wcel 2107 ≠ wne 2939 ∀wral 3060 Vcvv 3479 ⦋csb 3909 ifcif 4532 class class class wbr 5149 ↦ cmpt 5232 ‘cfv 6566 ℩crio 7391 (class class class)co 7435 Basecbs 17251 lecple 17311 joincjn 18375 meetcmee 18376 Atomscatm 39257 HLchlt 39344 LHypclh 39979 LTrncltrn 40096 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-rep 5286 ax-sep 5303 ax-nul 5313 ax-pow 5372 ax-pr 5439 ax-un 7758 ax-riotaBAD 38947 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1541 df-fal 1551 df-ex 1778 df-nf 1782 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3435 df-v 3481 df-sbc 3793 df-csb 3910 df-dif 3967 df-un 3969 df-in 3971 df-ss 3981 df-nul 4341 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4914 df-iun 4999 df-iin 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5584 df-xp 5696 df-rel 5697 df-cnv 5698 df-co 5699 df-dm 5700 df-rn 5701 df-res 5702 df-ima 5703 df-iota 6519 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7392 df-ov 7438 df-oprab 7439 df-mpo 7440 df-1st 8019 df-2nd 8020 df-undef 8303 df-map 8873 df-proset 18358 df-poset 18377 df-plt 18394 df-lub 18410 df-glb 18411 df-join 18412 df-meet 18413 df-p0 18489 df-p1 18490 df-lat 18496 df-clat 18563 df-oposet 39170 df-ol 39172 df-oml 39173 df-covers 39260 df-ats 39261 df-atl 39292 df-cvlat 39316 df-hlat 39345 df-llines 39493 df-lplanes 39494 df-lvols 39495 df-lines 39496 df-psubsp 39498 df-pmap 39499 df-padd 39791 df-lhyp 39983 df-laut 39984 df-ldil 40099 df-ltrn 40100 df-trl 40154 |
This theorem is referenced by: cdlemg2jOLDN 40593 |
Copyright terms: Public domain | W3C validator |