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 5069 | . . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑥 ≤ 𝑊 ↔ 𝑋 ≤ 𝑊)) | |
3 | 2 | notbid 320 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (¬ 𝑥 ≤ 𝑊 ↔ ¬ 𝑋 ≤ 𝑊)) |
4 | 3 | anbi2d 630 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊))) |
5 | 4 | notbid 320 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊))) |
6 | 5 | biimparc 482 | . . . . 5 ⊢ ((¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊)) |
7 | 6 | adantll 712 | . . . 4 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊)) |
8 | 7 | iffalsed 4478 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑥) |
9 | simpr 487 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋) | |
10 | 8, 9 | eqtrd 2856 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑋) |
11 | simpl 485 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑋 ∈ 𝐵) | |
12 | 1, 10, 11, 11 | fvmptd2 6776 | 1 ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ifcif 4467 class class class wbr 5066 ↦ cmpt 5146 ‘cfv 6355 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-iota 6314 df-fun 6357 df-fv 6363 |
This theorem is referenced by: cdleme31id 37545 cdleme32fvcl 37591 cdleme32e 37596 cdleme32le 37598 cdleme48gfv 37688 cdleme50ldil 37699 |
Copyright terms: Public domain | W3C validator |