Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pmtrfv | Structured version Visualization version GIF version |
Description: General value of mapping a point under a transposition. (Contributed by Stefan O'Rear, 16-Aug-2015.) |
Ref | Expression |
---|---|
pmtrfval.t | ⊢ 𝑇 = (pmTrsp‘𝐷) |
Ref | Expression |
---|---|
pmtrfv | ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → ((𝑇‘𝑃)‘𝑍) = if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pmtrfval.t | . . . . 5 ⊢ 𝑇 = (pmTrsp‘𝐷) | |
2 | 1 | pmtrval 17694 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → (𝑇‘𝑃) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))) |
3 | 2 | fveq1d 6105 | . . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) → ((𝑇‘𝑃)‘𝑍) = ((𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))‘𝑍)) |
4 | 3 | adantr 480 | . 2 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → ((𝑇‘𝑃)‘𝑍) = ((𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))‘𝑍)) |
5 | simpr 476 | . . 3 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → 𝑍 ∈ 𝐷) | |
6 | simpl3 1059 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → 𝑃 ≈ 2𝑜) | |
7 | relen 7846 | . . . . . 6 ⊢ Rel ≈ | |
8 | 7 | brrelexi 5082 | . . . . 5 ⊢ (𝑃 ≈ 2𝑜 → 𝑃 ∈ V) |
9 | difexg 4735 | . . . . 5 ⊢ (𝑃 ∈ V → (𝑃 ∖ {𝑍}) ∈ V) | |
10 | uniexg 6853 | . . . . 5 ⊢ ((𝑃 ∖ {𝑍}) ∈ V → ∪ (𝑃 ∖ {𝑍}) ∈ V) | |
11 | 6, 8, 9, 10 | 4syl 19 | . . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → ∪ (𝑃 ∖ {𝑍}) ∈ V) |
12 | ifexg 4107 | . . . 4 ⊢ ((∪ (𝑃 ∖ {𝑍}) ∈ V ∧ 𝑍 ∈ 𝐷) → if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍) ∈ V) | |
13 | 11, 5, 12 | syl2anc 691 | . . 3 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍) ∈ V) |
14 | eleq1 2676 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑧 ∈ 𝑃 ↔ 𝑍 ∈ 𝑃)) | |
15 | sneq 4135 | . . . . . . 7 ⊢ (𝑧 = 𝑍 → {𝑧} = {𝑍}) | |
16 | 15 | difeq2d 3690 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑃 ∖ {𝑧}) = (𝑃 ∖ {𝑍})) |
17 | 16 | unieqd 4382 | . . . . 5 ⊢ (𝑧 = 𝑍 → ∪ (𝑃 ∖ {𝑧}) = ∪ (𝑃 ∖ {𝑍})) |
18 | id 22 | . . . . 5 ⊢ (𝑧 = 𝑍 → 𝑧 = 𝑍) | |
19 | 14, 17, 18 | ifbieq12d 4063 | . . . 4 ⊢ (𝑧 = 𝑍 → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) = if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍)) |
20 | eqid 2610 | . . . 4 ⊢ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) | |
21 | 19, 20 | fvmptg 6189 | . . 3 ⊢ ((𝑍 ∈ 𝐷 ∧ if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍) ∈ V) → ((𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))‘𝑍) = if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍)) |
22 | 5, 13, 21 | syl2anc 691 | . 2 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → ((𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))‘𝑍) = if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍)) |
23 | 4, 22 | eqtrd 2644 | 1 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2𝑜) ∧ 𝑍 ∈ 𝐷) → ((𝑇‘𝑃)‘𝑍) = if(𝑍 ∈ 𝑃, ∪ (𝑃 ∖ {𝑍}), 𝑍)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ∖ cdif 3537 ⊆ wss 3540 ifcif 4036 {csn 4125 ∪ cuni 4372 class class class wbr 4583 ↦ cmpt 4643 ‘cfv 5804 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-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-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 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-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-en 7842 df-pmtr 17685 |
This theorem is referenced by: pmtrprfv 17696 pmtrprfv3 17697 pmtrmvd 17699 pmtrffv 17702 |
Copyright terms: Public domain | W3C validator |