Theorem cdleme42mN 40505

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. (Contributed by NM, 20-Mar-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cdleme41.b	⊢ 𝐵 = (Base‘𝐾)
cdleme41.l	⊢ ≤ = (le‘𝐾)
cdleme41.j	⊢ ∨ = (join‘𝐾)
cdleme41.m	⊢ ∧ = (meet‘𝐾)
cdleme41.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme41.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme41.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme41.d	⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme41.e	⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdleme41.g	⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdleme41.i	⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
cdleme41.n	⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)
cdleme41.o	⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))))
cdleme41.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))

Assertion

Ref	Expression
cdleme42mN	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝐹‘(𝑅 ∨ 𝑆)) = ((𝐹‘𝑅) ∨ (𝐹‘𝑆)))

Distinct variable groups:   𝐴,𝑠   ∨ ,𝑠   ≤ ,𝑠   ∧ ,𝑠   𝑃,𝑠   𝑄,𝑠   𝑅,𝑠   𝑆,𝑠   𝑈,𝑠   𝑊,𝑠   𝑦,𝑡,𝐴,𝑠   𝐵,𝑠,𝑡,𝑦   𝑦,𝐷   𝑦,𝐺   𝐸,𝑠,𝑦   𝐻,𝑠,𝑡,𝑦   𝑡, ∨ ,𝑦   𝐾,𝑠,𝑡,𝑦   𝑡, ≤ ,𝑦   𝑡, ∧ ,𝑦   𝑡,𝑃,𝑦   𝑡,𝑄,𝑦   𝑡,𝑅,𝑦   𝑡,𝑆,𝑦   𝑡,𝑈,𝑦   𝑡,𝑊,𝑦   𝑥,𝑧,𝐴   𝑥,𝐵,𝑧   𝑧,𝐸,𝑠   𝑧,𝐻   𝑥, ∨ ,𝑧   𝑧,𝐾   𝑥, ≤ ,𝑧   𝑥, ∧ ,𝑧   𝑥,𝑁,𝑧   𝑥,𝑃,𝑧   𝑥,𝑄,𝑧   𝑥,𝑅,𝑧   𝑥,𝑆,𝑧   𝑥,𝑈,𝑧   𝑥,𝑊,𝑧,𝑠,𝑡,𝑦

Allowed substitution hints:   𝐷(𝑥,𝑧,𝑡,𝑠)   𝐸(𝑥,𝑡)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐺(𝑥,𝑧,𝑡,𝑠)   𝐻(𝑥)   𝐼(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐾(𝑥)   𝑁(𝑦,𝑡,𝑠)   𝑂(𝑥,𝑦,𝑧,𝑡,𝑠)

Proof of Theorem cdleme42mN

Step	Hyp	Ref	Expression
1		simpl 482	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
2		simpr2 1196	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊))
3		simpr3 1197	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))
4		simpr1 1195	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → 𝑃 ≠ 𝑄)
5		cdleme41.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
6		cdleme41.l	. . . 4 ⊢ ≤ = (le‘𝐾)
7		cdleme41.j	. . . 4 ⊢ ∨ = (join‘𝐾)
8		cdleme41.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
9		cdleme41.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
10		cdleme41.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
11		cdleme41.u	. . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
12		cdleme41.d	. . . 4 ⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
13		cdleme41.e	. . . 4 ⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
14		cdleme41.g	. . . 4 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
15		cdleme41.i	. . . 4 ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
16		cdleme41.n	. . . 4 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)
17		cdleme41.o	. . . 4 ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))))
18		cdleme41.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))
19		eqid 2730	. . . 4 ⊢ ((𝑅 ∨ 𝑆) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊)
20	5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19	cdleme42g 40499	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (𝐹‘(𝑅 ∨ 𝑆)) = ((𝐹‘𝑅) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
21	1, 2, 3, 4, 20	syl121anc 1377	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝐹‘(𝑅 ∨ 𝑆)) = ((𝐹‘𝑅) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
22	5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19	cdleme42ke 40503	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → ((𝐹‘𝑅) ∨ (𝐹‘𝑆)) = ((𝐹‘𝑅) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
23	21, 22	eqtr4d 2768	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝐹‘(𝑅 ∨ 𝑆)) = ((𝐹‘𝑅) ∨ (𝐹‘𝑆)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2110   ≠ wne 2926  ∀wral 3045  ifcif 4473   class class class wbr 5089   ↦ cmpt 5170  ‘cfv 6477  ℩crio 7297  (class class class)co 7341  Basecbs 17112  lecple 17160  joincjn 18209  meetcmee 18210  Atomscatm 39281  HLchlt 39368  LHypclh 40002

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663  ax-riotaBAD 38971

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3344  df-reu 3345  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-iun 4941  df-iin 4942  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-f1 6482  df-fo 6483  df-f1o 6484  df-fv 6485  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-1st 7916  df-2nd 7917  df-undef 8198  df-proset 18192  df-poset 18211  df-plt 18226  df-lub 18242  df-glb 18243  df-join 18244  df-meet 18245  df-p0 18321  df-p1 18322  df-lat 18330  df-clat 18397  df-oposet 39194  df-ol 39196  df-oml 39197  df-covers 39284  df-ats 39285  df-atl 39316  df-cvlat 39340  df-hlat 39369  df-llines 39516  df-lplanes 39517  df-lvols 39518  df-lines 39519  df-psubsp 39521  df-pmap 39522  df-padd 39814  df-lhyp 40006

This theorem is referenced by:  cdleme42mgN  40506  cdlemeg46fjgN  40539