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

Theorem cdleme31sdnN 39892
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 31-Mar-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdleme31sdn.c 𝐶 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
cdleme31sdn.d 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdleme31sdn.n 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
Assertion
Ref Expression
cdleme31sdnN 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝑠 / 𝑡𝐷)
Distinct variable groups:   𝑡,   𝑡,   𝑡,𝑃   𝑡,𝑄   𝑡,𝑈   𝑡,𝑊   𝑡,𝑠
Allowed substitution hints:   𝐶(𝑡,𝑠)   𝐷(𝑡,𝑠)   𝑃(𝑠)   𝑄(𝑠)   𝑈(𝑠)   𝐼(𝑡,𝑠)   (𝑠)   (𝑡,𝑠)   (𝑠)   𝑁(𝑡,𝑠)   𝑊(𝑠)

Proof of Theorem cdleme31sdnN
StepHypRef Expression
1 cdleme31sdn.n . 2 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
2 biid 260 . . 3 (𝑠 (𝑃 𝑄) ↔ 𝑠 (𝑃 𝑄))
3 cdleme31sdn.d . . . . 5 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
4 cdleme31sdn.c . . . . 5 𝐶 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
53, 4cdleme31sc 39889 . . . 4 (𝑠 ∈ V → 𝑠 / 𝑡𝐷 = 𝐶)
65elv 3479 . . 3 𝑠 / 𝑡𝐷 = 𝐶
72, 6ifbieq2i 4557 . 2 if(𝑠 (𝑃 𝑄), 𝐼, 𝑠 / 𝑡𝐷) = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
81, 7eqtr4i 2759 1 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝑠 / 𝑡𝐷)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1533  Vcvv 3473  csb 3894  ifcif 4532   class class class wbr 5152  (class class class)co 7426
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-iota 6505  df-fv 6561  df-ov 7429
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator