Theorem cdleme42mN 41362

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 488	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
2		simpr2 1214	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊))
3		simpr3 1215	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))
4		simpr1 1213	. . 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 2762	. . . 4 ⊢ ((𝑅 ∨ 𝑆) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊)
20	5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19	cdleme42g 41356	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (𝐹‘(𝑅 ∨ 𝑆)) = ((𝐹‘𝑅) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
21	1, 2, 3, 4, 20	syl121anc 1402	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝐹‘(𝑅 ∨ 𝑆)) = ((𝐹‘𝑅) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
22	5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19	cdleme42ke 41360	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → ((𝐹‘𝑅) ∨ (𝐹‘𝑆)) = ((𝐹‘𝑅) ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
23	21, 22	eqtr4d 2800	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))) → (𝐹‘(𝑅 ∨ 𝑆)) = ((𝐹‘𝑅) ∨ (𝐹‘𝑆)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ifcif 4485   class class class wbr 5107   ↦ cmpt 5190  ‘cfv 6537  ℩crio 7372  (class class class)co 7416  Basecbs 17305  lecple 17353  joincjn 18403  meetcmee 18404  Atomscatm 40138  HLchlt 40225  LHypclh 40859

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 7739  ax-riotaBAD 39828

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 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-undef 8274  df-proset 18386  df-poset 18405  df-plt 18420  df-lub 18436  df-glb 18437  df-join 18438  df-meet 18439  df-p0 18515  df-p1 18516  df-lat 18524  df-clat 18591  df-oposet 40051  df-ol 40053  df-oml 40054  df-covers 40141  df-ats 40142  df-atl 40173  df-cvlat 40197  df-hlat 40226  df-llines 40373  df-lplanes 40374  df-lvols 40375  df-lines 40376  df-psubsp 40378  df-pmap 40379  df-padd 40671  df-lhyp 40863

This theorem is used by:  cdleme42mgN  41363  cdlemeg46fjgN  41396