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 38881
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 2737 . . . . 5 if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷)
31, 2cdleme31sn 38872 . . . 4 (𝑅𝐴𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
43adantr 482 . . 3 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
5 iffalse 4500 . . . . 5 𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠𝐷)
6 cdleme32sn2.d . . . . . 6 𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
76csbeq2i 3868 . . . . 5 𝑅 / 𝑠𝐷 = 𝑅 / 𝑠((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
85, 7eqtrdi 2793 . . . 4 𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))))
9 nfcvd 2909 . . . . 5 (𝑅𝐴𝑠((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
10 oveq1 7369 . . . . . 6 (𝑠 = 𝑅 → (𝑠 𝑈) = (𝑅 𝑈))
11 oveq2 7370 . . . . . . . 8 (𝑠 = 𝑅 → (𝑃 𝑠) = (𝑃 𝑅))
1211oveq1d 7377 . . . . . . 7 (𝑠 = 𝑅 → ((𝑃 𝑠) 𝑊) = ((𝑃 𝑅) 𝑊))
1312oveq2d 7378 . . . . . 6 (𝑠 = 𝑅 → (𝑄 ((𝑃 𝑠) 𝑊)) = (𝑄 ((𝑃 𝑅) 𝑊)))
1410, 13oveq12d 7380 . . . . 5 (𝑠 = 𝑅 → ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
159, 14csbiegf 3894 . . . 4 (𝑅𝐴𝑅 / 𝑠((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
168, 15sylan9eqr 2799 . . 3 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
174, 16eqtrd 2777 . 2 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
18 cdleme31sn2.c . 2 𝐶 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊)))
1917, 18eqtr4di 2795 1 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397   = wceq 1542  wcel 2107  csb 3860  ifcif 4491   class class class wbr 5110  (class class class)co 7362
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2708
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2890  df-rab 3411  df-v 3450  df-sbc 3745  df-csb 3861  df-dif 3918  df-un 3920  df-in 3922  df-ss 3932  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-iota 6453  df-fv 6509  df-ov 7365
This theorem is referenced by:  cdlemefr32sn2aw  38896  cdleme43frv1snN  38900  cdlemefr31fv1  38903  cdleme35sn2aw  38950  cdleme35sn3a  38951
  Copyright terms: Public domain W3C validator