Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pmtrf | Structured version Visualization version GIF version |
Description: Functionality of a transposition. (Contributed by Stefan O'Rear, 16-Aug-2015.) |
Ref | Expression |
---|---|
pmtrfval.t | ⊢ 𝑇 = (pmTrsp‘𝐷) |
Ref | Expression |
---|---|
pmtrf | ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑇‘𝑃):𝐷⟶𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll2 1101 | . . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑃 ⊆ 𝐷) | |
2 | 1onn 7719 | . . . . . . . 8 ⊢ 1𝑜 ∈ ω | |
3 | 2 | a1i 11 | . . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 1𝑜 ∈ ω) |
4 | simpll3 1102 | . . . . . . . 8 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ 2𝑜) | |
5 | df-2o 7561 | . . . . . . . 8 ⊢ 2𝑜 = suc 1𝑜 | |
6 | 4, 5 | syl6breq 4694 | . . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ suc 1𝑜) |
7 | simpr 477 | . . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑧 ∈ 𝑃) | |
8 | dif1en 8193 | . . . . . . 7 ⊢ ((1𝑜 ∈ ω ∧ 𝑃 ≈ suc 1𝑜 ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1𝑜) | |
9 | 3, 6, 7, 8 | syl3anc 1326 | . . . . . 6 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1𝑜) |
10 | en1uniel 8028 | . . . . . 6 ⊢ ((𝑃 ∖ {𝑧}) ≈ 1𝑜 → ∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧})) | |
11 | eldifi 3732 | . . . . . 6 ⊢ (∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}) → ∪ (𝑃 ∖ {𝑧}) ∈ 𝑃) | |
12 | 9, 10, 11 | 3syl 18 | . . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → ∪ (𝑃 ∖ {𝑧}) ∈ 𝑃) |
13 | 1, 12 | sseldd 3604 | . . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → ∪ (𝑃 ∖ {𝑧}) ∈ 𝐷) |
14 | simplr 792 | . . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ ¬ 𝑧 ∈ 𝑃) → 𝑧 ∈ 𝐷) | |
15 | 13, 14 | ifclda 4120 | . . 3 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ∈ 𝐷) |
16 | eqid 2622 | . . 3 ⊢ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) | |
17 | 15, 16 | fmptd 6385 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)):𝐷⟶𝐷) |
18 | pmtrfval.t | . . . 4 ⊢ 𝑇 = (pmTrsp‘𝐷) | |
19 | 18 | pmtrval 17871 | . . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑇‘𝑃) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))) |
20 | 19 | feq1d 6030 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → ((𝑇‘𝑃):𝐷⟶𝐷 ↔ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)):𝐷⟶𝐷)) |
21 | 17, 20 | mpbird 247 | 1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑇‘𝑃):𝐷⟶𝐷) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∖ cdif 3571 ⊆ wss 3574 ifcif 4086 {csn 4177 ∪ cuni 4436 class class class wbr 4653 ↦ cmpt 4729 suc csuc 5725 ⟶wf 5884 ‘cfv 5888 ωcom 7065 1𝑜c1o 7553 2𝑜c2o 7554 ≈ cen 7952 pmTrspcpmtr 17861 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-om 7066 df-1o 7560 df-2o 7561 df-er 7742 df-en 7956 df-fin 7959 df-pmtr 17862 |
This theorem is referenced by: pmtrmvd 17876 pmtrfinv 17881 pmtrff1o 17883 pmtrfcnv 17884 pmtr3ncomlem1 17893 mdetralt 20414 mdetunilem7 20424 |
Copyright terms: Public domain | W3C validator |