Theorem cdleme43frv1snN 41466

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 41447	1 ⊢ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 = 𝑋)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ⦋csb 3846  ifcif 4481   class class class wbr 5102  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  lecple 17435  joincjn 18485  meetcmee 18486  Atomscatm 40321  LHypclh 41042

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546  df-ov 7423

This theorem is used by: (None)