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

Theorem cdleme31fv2 41544
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 23-Feb-2013.)
Hypothesis
Ref Expression
cdleme31fv2.f 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))
Assertion
Ref Expression
cdleme31fv2 ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋)
Distinct variable groups:   𝑥,𝐵   𝑥, ≤   𝑥,𝑃   𝑥,𝑄   𝑥,𝑊   𝑥,𝑋
Allowed substitution hints:   𝐹(𝑥)   𝑂(𝑥)

Proof of Theorem cdleme31fv2
StepHypRef Expression
1 cdleme31fv2.f . 2 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))
2 breq1 5105 . . . . . . . . 9 (𝑥 = 𝑋 → (𝑥 ≤ 𝑊 ↔ 𝑋 ≤ 𝑊))
32notbid 321 . . . . . . . 8 (𝑥 = 𝑋 → (¬ 𝑥 ≤ 𝑊 ↔ ¬ 𝑋 ≤ 𝑊))
43anbi2d 642 . . . . . . 7 (𝑥 = 𝑋 → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)))
54notbid 321 . . . . . 6 (𝑥 = 𝑋 → (¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)))
65biimparc 485 . . . . 5 ((¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊))
76adantll 727 . . . 4 (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊))
87iffalsed 4492 . . 3 (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑥)
9 simpr 490 . . 3 (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
108, 9eqtrd 2795 . 2 (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑋)
11 simpl 488 . 2 ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑋 ∈ 𝐵)
121, 10, 11, 11fvmptd2 7003 1 ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ifcif 4481   class class class wbr 5102   ↦ cmpt 5185  ‘cfv 6539
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547
This theorem is used by:  cdleme31id  41545  cdleme32fvcl  41591  cdleme32e  41596  cdleme32le  41598  cdleme48gfv  41688  cdleme50ldil  41699
  Copyright terms: Public domain W3C validator