![]() |
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 318 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (¬ 𝑥 ≤ 𝑊 ↔ ¬ 𝑋 ≤ 𝑊)) |
4 | 3 | anbi2d 630 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊))) |
5 | 4 | notbid 318 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊))) |
6 | 5 | biimparc 481 | . . . . 5 ⊢ ((¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊)) |
7 | 6 | adantll 713 | . . . 4 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊)) |
8 | 7 | iffalsed 4502 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑥) |
9 | simpr 486 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋) | |
10 | 8, 9 | eqtrd 2777 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑥 = 𝑋) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = 𝑋) |
11 | simpl 484 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑋 ∈ 𝐵) | |
12 | 1, 10, 11, 11 | fvmptd2 6961 | 1 ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2944 ifcif 4491 class class class wbr 5110 ↦ cmpt 5193 ‘cfv 6501 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2708 ax-sep 5261 ax-nul 5268 ax-pr 5389 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2890 df-ral 3066 df-rex 3075 df-rab 3411 df-v 3450 df-sbc 3745 df-csb 3861 df-dif 3918 df-un 3920 df-in 3922 df-ss 3932 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-opab 5173 df-mpt 5194 df-id 5536 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-iota 6453 df-fun 6503 df-fv 6509 |
This theorem is referenced by: cdleme31id 38886 cdleme32fvcl 38932 cdleme32e 38937 cdleme32le 38939 cdleme48gfv 39029 cdleme50ldil 39040 |
Copyright terms: Public domain | W3C validator |