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 35986
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 2651 . . . 4 if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷)
31, 2cdleme31sn 35985 . . 3 (𝑅𝐴𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
43adantr 480 . 2 ((𝑅𝐴𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷))
5 iftrue 4125 . . . . 5 (𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠𝐼)
6 cdleme31sn1.i . . . . . 6 𝐼 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺))
76csbeq2i 4026 . . . . 5 𝑅 / 𝑠𝐼 = 𝑅 / 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺))
85, 7syl6eq 2701 . . . 4 (𝑅 (𝑃 𝑄) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝑅 / 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺)))
9 nfcv 2793 . . . . . . . 8 𝑠𝐴
10 nfv 1883 . . . . . . . . 9 𝑠𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄))
11 nfcsb1v 3582 . . . . . . . . . 10 𝑠𝑅 / 𝑠𝐺
1211nfeq2 2809 . . . . . . . . 9 𝑠 𝑦 = 𝑅 / 𝑠𝐺
1310, 12nfim 1865 . . . . . . . 8 𝑠((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)
149, 13nfral 2974 . . . . . . 7 𝑠𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)
15 nfcv 2793 . . . . . . 7 𝑠𝐵
1614, 15nfriota 6660 . . . . . 6 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺))
1716a1i 11 . . . . 5 (𝑅𝐴𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
18 csbeq1a 3575 . . . . . . . . 9 (𝑠 = 𝑅𝐺 = 𝑅 / 𝑠𝐺)
1918eqeq2d 2661 . . . . . . . 8 (𝑠 = 𝑅 → (𝑦 = 𝐺𝑦 = 𝑅 / 𝑠𝐺))
2019imbi2d 329 . . . . . . 7 (𝑠 = 𝑅 → (((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺) ↔ ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
2120ralbidv 3015 . . . . . 6 (𝑠 = 𝑅 → (∀𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺) ↔ ∀𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
2221riotabidv 6653 . . . . 5 (𝑠 = 𝑅 → (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺)) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
2317, 22csbiegf 3590 . . . 4 (𝑅𝐴𝑅 / 𝑠(𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐺)) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
248, 23sylan9eqr 2707 . . 3 ((𝑅𝐴𝑅 (𝑃 𝑄)) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺)))
25 cdleme31sn1.c . . 3 𝐶 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝑅 / 𝑠𝐺))
2624, 25syl6eqr 2703 . 2 ((𝑅𝐴𝑅 (𝑃 𝑄)) → if(𝑅 (𝑃 𝑄), 𝑅 / 𝑠𝐼, 𝑅 / 𝑠𝐷) = 𝐶)
274, 26eqtrd 2685 1 ((𝑅𝐴𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383   = wceq 1523  wcel 2030  wnfc 2780  wral 2941  csb 3566  ifcif 4119   class class class wbr 4685  crio 6650  (class class class)co 6690
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-iota 5889  df-riota 6651
This theorem is referenced by:  cdleme31sn1c  35993
  Copyright terms: Public domain W3C validator