Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdleme31sn2 Structured version   Visualization version   GIF version

Theorem cdleme31sn2 40371
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.)
Hypotheses
Ref Expression
cdleme32sn2.d 𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
cdleme31sn2.n 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐷)
cdleme31sn2.c 𝐶 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊)))
Assertion
Ref Expression
cdleme31sn2 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = 𝐶)
Distinct variable groups:   𝐴,𝑠   ,𝑠   ,𝑠   ,𝑠   𝑃,𝑠   𝑄,𝑠   𝑅,𝑠   𝑈,𝑠   𝑊,𝑠
Allowed substitution hints:   𝐶(𝑠)   𝐷(𝑠)   𝐼(𝑠)   𝑁(𝑠)

Proof of Theorem cdleme31sn2
StepHypRef Expression
1 cdleme31sn2.n . . . . 5 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐷)
2 eqid 2734 . . . . 5 if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷)
31, 2cdleme31sn 40362 . . . 4 (𝑅𝐴𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
43adantr 480 . . 3 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
5 iffalse 4539 . . . . 5 𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠𝐷)
6 cdleme32sn2.d . . . . . 6 𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
76csbeq2i 3915 . . . . 5 𝑅 / 𝑠𝐷 = 𝑅 / 𝑠((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
85, 7eqtrdi 2790 . . . 4 𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))))
9 nfcvd 2903 . . . . 5 (𝑅𝐴𝑠((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
10 oveq1 7437 . . . . . 6 (𝑠 = 𝑅 → (𝑠 𝑈) = (𝑅 𝑈))
11 oveq2 7438 . . . . . . . 8 (𝑠 = 𝑅 → (𝑃 𝑠) = (𝑃 𝑅))
1211oveq1d 7445 . . . . . . 7 (𝑠 = 𝑅 → ((𝑃 𝑠) 𝑊) = ((𝑃 𝑅) 𝑊))
1312oveq2d 7446 . . . . . 6 (𝑠 = 𝑅 → (𝑄 ((𝑃 𝑠) 𝑊)) = (𝑄 ((𝑃 𝑅) 𝑊)))
1410, 13oveq12d 7448 . . . . 5 (𝑠 = 𝑅 → ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
159, 14csbiegf 3941 . . . 4 (𝑅𝐴𝑅 / 𝑠((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
168, 15sylan9eqr 2796 . . 3 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
174, 16eqtrd 2774 . 2 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
18 cdleme31sn2.c . 2 𝐶 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊)))
1917, 18eqtr4di 2792 1 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1536  wcel 2105  csb 3907  ifcif 4530   class class class wbr 5147  (class class class)co 7430
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:  cdlemefr32sn2aw  40386  cdleme43frv1snN  40390  cdlemefr31fv1  40393  cdleme35sn2aw  40440  cdleme35sn3a  40441
  Copyright terms: Public domain W3C validator