| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme31fv2 | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 23-Feb-2013.) |
| Ref | Expression |
|---|---|
| cdleme31fv2.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) |
| Ref | Expression |
|---|---|
| cdleme31fv2 | ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdleme31fv2.f | . 2 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) | |
| 2 | breq1 5113 | . . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑥 ≤ 𝑊 ↔ 𝑋 ≤ 𝑊)) | |
| 3 | 2 | notbid 321 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (¬ 𝑥 ≤ 𝑊 ↔ ¬ 𝑋 ≤ 𝑊)) |
| 4 | 3 | anbi2d 641 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊))) |
| 5 | 4 | notbid 321 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊))) |
| 6 | 5 | biimparc 484 | . . . . 5 ⊢ ((¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊)) |
| 7 | 6 | adantll 726 | . . . 4 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊)) |
| 8 | 7 | iffalsed 4499 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑥) |
| 9 | simpr 489 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋) | |
| 10 | 8, 9 | eqtrd 2798 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑋) |
| 11 | simpl 487 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑋 ∈ 𝐵) | |
| 12 | 1, 10, 11, 11 | fvmptd2 7000 | 1 ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ifcif 4488 class class class wbr 5110 ↦ cmpt 5193 ‘cfv 6538 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6494 df-fun 6540 df-fv 6546 |
| This theorem is referenced by: cdleme31id 41149 cdleme32fvcl 41195 cdleme32e 41200 cdleme32le 41202 cdleme48gfv 41292 cdleme50ldil 41303 |
| Copyright terms: Public domain | W3C validator |