Theorem cdleme9tN 39762

Description: Part of proof of Lemma E in [Crawley] p. 113, 2nd paragraph on p. 114. 𝑋 and 𝐹 represent t₁ and f(t) respectively. In their notation, we prove f(t) ∨ t₁ = q ∨ t₁. (Contributed by NM, 8-Oct-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cdleme9t.l	⊢ ≤ = (le‘𝐾)
cdleme9t.j	⊢ ∨ = (join‘𝐾)
cdleme9t.m	⊢ ∧ = (meet‘𝐾)
cdleme9t.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme9t.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme9t.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme9t.g	⊢ 𝐹 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊)))
cdleme9t.x	⊢ 𝑋 = ((𝑃 ∨ 𝑇) ∧ 𝑊)

Assertion

Ref	Expression
cdleme9tN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄)) → (𝐹 ∨ 𝑋) = (𝑄 ∨ 𝑋))

Proof of Theorem cdleme9tN

Step	Hyp	Ref	Expression
1		cdleme9t.l	. 2 ⊢ ≤ = (le‘𝐾)
2		cdleme9t.j	. 2 ⊢ ∨ = (join‘𝐾)
3		cdleme9t.m	. 2 ⊢ ∧ = (meet‘𝐾)
4		cdleme9t.a	. 2 ⊢ 𝐴 = (Atoms‘𝐾)
5		cdleme9t.h	. 2 ⊢ 𝐻 = (LHyp‘𝐾)
6		cdleme9t.u	. 2 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
7		cdleme9t.g	. 2 ⊢ 𝐹 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊)))
8		cdleme9t.x	. 2 ⊢ 𝑋 = ((𝑃 ∨ 𝑇) ∧ 𝑊)
9	1, 2, 3, 4, 5, 6, 7, 8	cdleme9 39758	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄)) → (𝐹 ∨ 𝑋) = (𝑄 ∨ 𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098   class class class wbr 5152  ‘cfv 6553  (class class class)co 7426  lecple 17247  joincjn 18310  meetcmee 18311  Atomscatm 38767  HLchlt 38854  LHypclh 39489

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-rep 5289  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7746

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-iun 5002  df-iin 5003  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-fv 6561  df-riota 7382  df-ov 7429  df-oprab 7430  df-mpo 7431  df-1st 7999  df-2nd 8000  df-proset 18294  df-poset 18312  df-plt 18329  df-lub 18345  df-glb 18346  df-join 18347  df-meet 18348  df-p0 18424  df-p1 18425  df-lat 18431  df-clat 18498  df-oposet 38680  df-ol 38682  df-oml 38683  df-covers 38770  df-ats 38771  df-atl 38802  df-cvlat 38826  df-hlat 38855  df-psubsp 39008  df-pmap 39009  df-padd 39301  df-lhyp 39493

This theorem is referenced by: (None)