Theorem cdlemc4 40778

Description: Part of proof of Lemma C in [Crawley] p. 113. (Contributed by NM, 26-May-2012.)

Hypotheses

Ref	Expression
cdlemc3.l	⊢ ≤ = (le‘𝐾)
cdlemc3.j	⊢ ∨ = (join‘𝐾)
cdlemc3.m	⊢ ∧ = (meet‘𝐾)
cdlemc3.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemc3.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemc3.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemc3.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

Assertion

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

Proof of Theorem cdlemc4

Step	Hyp	Ref	Expression
1		simpll 776	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝐾 ∈ HL)
2	1	hllatd 39948	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝐾 ∈ Lat)
3		simpl 486	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
4		simpr1 1207	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝐹 ∈ 𝑇)
5		simpr2l 1245	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑃 ∈ 𝐴)
6		eqid 2761	. . . . . . . . 9 ⊢ (Base‘𝐾) = (Base‘𝐾)
7		cdlemc3.a	. . . . . . . . 9 ⊢ 𝐴 = (Atoms‘𝐾)
8	6, 7	atbase 39873	. . . . . . . 8 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
9	5, 8	syl 17	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑃 ∈ (Base‘𝐾))
10		cdlemc3.h	. . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾)
11		cdlemc3.t	. . . . . . . 8 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
12	6, 10, 11	ltrncl 40709	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ (Base‘𝐾)) → (𝐹‘𝑃) ∈ (Base‘𝐾))
13	3, 4, 9, 12	syl3anc 1389	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐹‘𝑃) ∈ (Base‘𝐾))
14		simpr3l 1247	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑄 ∈ 𝐴)
15		cdlemc3.j	. . . . . . . . 9 ⊢ ∨ = (join‘𝐾)
16	6, 15, 7	hlatjcl 39951	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
17	1, 5, 14, 16	syl3anc 1389	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
18	6, 10	lhpbase 40582	. . . . . . . 8 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
19	18	ad2antlr 737	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑊 ∈ (Base‘𝐾))
20		cdlemc3.m	. . . . . . . 8 ⊢ ∧ = (meet‘𝐾)
21	6, 20	latmcl 18462	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑄) ∧ 𝑊) ∈ (Base‘𝐾))
22	2, 17, 19, 21	syl3anc 1389	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝑃 ∨ 𝑄) ∧ 𝑊) ∈ (Base‘𝐾))
23		cdlemc3.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
24	6, 23, 15	latlej1 18470	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝐹‘𝑃) ∈ (Base‘𝐾) ∧ ((𝑃 ∨ 𝑄) ∧ 𝑊) ∈ (Base‘𝐾)) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)))
25	2, 13, 22, 24	syl3anc 1389	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)))
26		breq2 5101	. . . . 5 ⊢ ((𝑄 ∨ (𝑅‘𝐹)) = ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) → ((𝐹‘𝑃) ≤ (𝑄 ∨ (𝑅‘𝐹)) ↔ (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊))))
27	25, 26	syl5ibrcom 249	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝑄 ∨ (𝑅‘𝐹)) = ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) → (𝐹‘𝑃) ≤ (𝑄 ∨ (𝑅‘𝐹))))
28		cdlemc3.r	. . . . 5 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
29	23, 15, 20, 7, 10, 11, 28	cdlemc3 40777	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝐹‘𝑃) ≤ (𝑄 ∨ (𝑅‘𝐹)) → 𝑄 ≤ (𝑃 ∨ (𝐹‘𝑃))))
30	27, 29	syld 47	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝑄 ∨ (𝑅‘𝐹)) = ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) → 𝑄 ≤ (𝑃 ∨ (𝐹‘𝑃))))
31	30	necon3bd 2970	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (¬ 𝑄 ≤ (𝑃 ∨ (𝐹‘𝑃)) → (𝑄 ∨ (𝑅‘𝐹)) ≠ ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊))))
32	31	3impia 1129	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ¬ 𝑄 ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑄 ∨ (𝑅‘𝐹)) ≠ ((𝐹‘𝑃) ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141   ≠ wne 2956   class class class wbr 5097  ‘cfv 6515  (class class class)co 7390  Basecbs 17235  lecple 17283  joincjn 18333  meetcmee 18334  Latclat 18453  Atomscatm 39847  HLchlt 39934  LHypclh 40568  LTrncltrn 40685  trLctrl 40742

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-iin 4949  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7964  df-2nd 7965  df-map 8803  df-proset 18316  df-poset 18335  df-plt 18350  df-lub 18366  df-glb 18367  df-join 18368  df-meet 18369  df-p0 18445  df-p1 18446  df-lat 18454  df-clat 18521  df-oposet 39760  df-ol 39762  df-oml 39763  df-covers 39850  df-ats 39851  df-atl 39882  df-cvlat 39906  df-hlat 39935  df-psubsp 40087  df-pmap 40088  df-padd 40380  df-lhyp 40572  df-laut 40573  df-ldil 40688  df-ltrn 40689  df-trl 40743

This theorem is referenced by:  cdlemc5  40779