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

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

Proof of Theorem cdleme31sn1
StepHypRef Expression
1 cdleme31sn1.n . . . 4 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐷)
2 eqid 2734 . . . 4 if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷)
31, 2cdleme31sn 40362 . . 3 (𝑅𝐴𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
43adantr 480 . 2 ((𝑅𝐴𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
5 iftrue 4536 . . . . 5 (𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠𝐼)
6 cdleme31sn1.i . . . . . 6 𝐼 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺))
76csbeq2i 3915 . . . . 5 𝑅 / 𝑠𝐼 = 𝑅 / 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺))
85, 7eqtrdi 2790 . . . 4 (𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺)))
9 nfcv 2902 . . . . . . . 8 𝑠𝐴
10 nfv 1911 . . . . . . . . 9 𝑠𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄))
11 nfcsb1v 3932 . . . . . . . . . 10 𝑠𝑅 / 𝑠𝐺
1211nfeq2 2920 . . . . . . . . 9 𝑠 𝑦 = 𝑅 / 𝑠𝐺
1310, 12nfim 1893 . . . . . . . 8 𝑠((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)
149, 13nfralw 3308 . . . . . . 7 𝑠𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)
15 nfcv 2902 . . . . . . 7 𝑠𝐵
1614, 15nfriota 7399 . . . . . 6 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺))
1716a1i 11 . . . . 5 (𝑅𝐴𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
18 csbeq1a 3921 . . . . . . . . 9 (𝑠 = 𝑅𝐺 = 𝑅 / 𝑠𝐺)
1918eqeq2d 2745 . . . . . . . 8 (𝑠 = 𝑅 → (𝑦 = 𝐺𝑦 = 𝑅 / 𝑠𝐺))
2019imbi2d 340 . . . . . . 7 (𝑠 = 𝑅 → (((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺) ↔ ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
2120ralbidv 3175 . . . . . 6 (𝑠 = 𝑅 → (∀𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺) ↔ ∀𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
2221riotabidv 7389 . . . . 5 (𝑠 = 𝑅 → (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺)) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
2317, 22csbiegf 3941 . . . 4 (𝑅𝐴𝑅 / 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺)) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
248, 23sylan9eqr 2796 . . 3 ((𝑅𝐴𝑅 (𝑃 𝑄)) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
25 cdleme31sn1.c . . 3 𝐶 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺))
2624, 25eqtr4di 2792 . 2 ((𝑅𝐴𝑅 (𝑃 𝑄)) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝐶)
274, 26eqtrd 2774 1 ((𝑅𝐴𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1536  wcel 2105  wnfc 2887  wral 3058  csb 3907  ifcif 4530   class class class wbr 5147  crio 7386  (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-ral 3059  df-rex 3068  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-riota 7387
This theorem is referenced by:  cdleme31sn1c  40370
  Copyright terms: Public domain W3C validator