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 1094 | . . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑃 ⊆ 𝐷) | |
2 | 1onn 7606 | . . . . . . . 8 ⊢ 1𝑜 ∈ ω | |
3 | 2 | a1i 11 | . . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 1𝑜 ∈ ω) |
4 | simpll3 1095 | . . . . . . . 8 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ 2𝑜) | |
5 | df-2o 7448 | . . . . . . . 8 ⊢ 2𝑜 = suc 1𝑜 | |
6 | 4, 5 | syl6breq 4624 | . . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ suc 1𝑜) |
7 | simpr 476 | . . . . . . 7 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → 𝑧 ∈ 𝑃) | |
8 | dif1en 8078 | . . . . . . 7 ⊢ ((1𝑜 ∈ ω ∧ 𝑃 ≈ suc 1𝑜 ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1𝑜) | |
9 | 3, 6, 7, 8 | syl3anc 1318 | . . . . . 6 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1𝑜) |
10 | en1uniel 7914 | . . . . . 6 ⊢ ((𝑃 ∖ {𝑧}) ≈ 1𝑜 → ∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧})) | |
11 | eldifi 3694 | . . . . . 6 ⊢ (∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}) → ∪ (𝑃 ∖ {𝑧}) ∈ 𝑃) | |
12 | 9, 10, 11 | 3syl 18 | . . . . 5 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → ∪ (𝑃 ∖ {𝑧}) ∈ 𝑃) |
13 | 1, 12 | sseldd 3569 | . . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ 𝑧 ∈ 𝑃) → ∪ (𝑃 ∖ {𝑧}) ∈ 𝐷) |
14 | simplr 788 | . . . 4 ⊢ ((((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) ∧ ¬ 𝑧 ∈ 𝑃) → 𝑧 ∈ 𝐷) | |
15 | 13, 14 | ifclda 4070 | . . 3 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑧 ∈ 𝐷) → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ∈ 𝐷) |
16 | eqid 2610 | . . 3 ⊢ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) | |
17 | 15, 16 | fmptd 6292 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)):𝐷⟶𝐷) |
18 | pmtrfval.t | . . . 4 ⊢ 𝑇 = (pmTrsp‘𝐷) | |
19 | 18 | pmtrval 17694 | . . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑇‘𝑃) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))) |
20 | 19 | feq1d 5943 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → ((𝑇‘𝑃):𝐷⟶𝐷 ↔ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)):𝐷⟶𝐷)) |
21 | 17, 20 | mpbird 246 | 1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑇‘𝑃):𝐷⟶𝐷) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∖ cdif 3537 ⊆ wss 3540 ifcif 4036 {csn 4125 ∪ cuni 4372 class class class wbr 4583 ↦ cmpt 4643 suc csuc 5642 ⟶wf 5800 ‘cfv 5804 ωcom 6957 1𝑜c1o 7440 2𝑜c2o 7441 ≈ cen 7838 pmTrspcpmtr 17684 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-om 6958 df-1o 7447 df-2o 7448 df-er 7629 df-en 7842 df-fin 7845 df-pmtr 17685 |
This theorem is referenced by: pmtrmvd 17699 pmtrfinv 17704 pmtrff1o 17706 pmtrfcnv 17707 pmtr3ncomlem1 17716 mdetralt 20233 mdetunilem7 20243 |
Copyright terms: Public domain | W3C validator |