Theorem cdleme43frv1snN 40390

Description: Value of ⦋𝑅 / 𝑠⦌𝑁 when ¬ 𝑅 ≤ (𝑃 ∨ 𝑄). (Contributed by NM, 30-Mar-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cdlemefr27.b	⊢ 𝐵 = (Base‘𝐾)
cdlemefr27.l	⊢ ≤ = (le‘𝐾)
cdlemefr27.j	⊢ ∨ = (join‘𝐾)
cdlemefr27.m	⊢ ∧ = (meet‘𝐾)
cdlemefr27.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemefr27.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemefr27.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdlemefr27.c	⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdlemefr27.n	⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶)
cdleme43fr.x	⊢ 𝑋 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊)))

Assertion

Ref	Expression
cdleme43frv1snN	⊢ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 = 𝑋)

Distinct variable groups:   𝐴,𝑠   ∨ ,𝑠   ≤ ,𝑠   ∧ ,𝑠   𝑃,𝑠   𝑄,𝑠   𝑅,𝑠   𝑈,𝑠   𝑊,𝑠   𝐻,𝑠   𝐾,𝑠   𝐵,𝑠

Allowed substitution hints:   𝐶(𝑠)   𝐼(𝑠)   𝑁(𝑠)   𝑋(𝑠)

Proof of Theorem cdleme43frv1snN

Step	Hyp	Ref	Expression
1		cdlemefr27.c	. 2 ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
2		cdlemefr27.n	. 2 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶)
3		cdleme43fr.x	. 2 ⊢ 𝑋 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊)))
4	1, 2, 3	cdleme31sn2 40371	1 ⊢ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 = 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1536   ∈ wcel 2105  ⦋csb 3907  ifcif 4530   class class class wbr 5147  ‘cfv 6562  (class class class)co 7430  Basecbs 17244  lecple 17304  joincjn 18368  meetcmee 18369  Atomscatm 39244  LHypclh 39966

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-iota 6515  df-fv 6570  df-ov 7433

This theorem is referenced by: (None)