| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pmtrfmvdn0 | Structured version Visualization version GIF version | ||
| Description: A transposition moves at least one point. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
| Ref | Expression |
|---|---|
| pmtrrn.t | ⊢ 𝑇 = (pmTrsp‘𝐷) |
| pmtrrn.r | ⊢ 𝑅 = ran 𝑇 |
| Ref | Expression |
|---|---|
| pmtrfmvdn0 | ⊢ (𝐹 ∈ 𝑅 → dom (𝐹 ∖ I ) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2on0 8498 | . 2 ⊢ 2o ≠ ∅ | |
| 2 | pmtrrn.t | . . . . . . . 8 ⊢ 𝑇 = (pmTrsp‘𝐷) | |
| 3 | pmtrrn.r | . . . . . . . 8 ⊢ 𝑅 = ran 𝑇 | |
| 4 | eqid 2760 | . . . . . . . 8 ⊢ dom (𝐹 ∖ I ) = dom (𝐹 ∖ I ) | |
| 5 | 2, 3, 4 | pmtrfrn 19681 | . . . . . . 7 ⊢ (𝐹 ∈ 𝑅 → ((𝐷 ∈ V ∧ dom (𝐹 ∖ I ) ⊆ 𝐷 ∧ dom (𝐹 ∖ I ) ≈ 2o) ∧ 𝐹 = (𝑇‘dom (𝐹 ∖ I )))) |
| 6 | 5 | simpld 500 | . . . . . 6 ⊢ (𝐹 ∈ 𝑅 → (𝐷 ∈ V ∧ dom (𝐹 ∖ I ) ⊆ 𝐷 ∧ dom (𝐹 ∖ I ) ≈ 2o)) |
| 7 | 6 | simp3d 1162 | . . . . 5 ⊢ (𝐹 ∈ 𝑅 → dom (𝐹 ∖ I ) ≈ 2o) |
| 8 | enen1 9143 | . . . . 5 ⊢ (dom (𝐹 ∖ I ) ≈ 2o → (dom (𝐹 ∖ I ) ≈ ∅ ↔ 2o ≈ ∅)) | |
| 9 | 7, 8 | syl 18 | . . . 4 ⊢ (𝐹 ∈ 𝑅 → (dom (𝐹 ∖ I ) ≈ ∅ ↔ 2o ≈ ∅)) |
| 10 | en0 9052 | . . . 4 ⊢ (dom (𝐹 ∖ I ) ≈ ∅ ↔ dom (𝐹 ∖ I ) = ∅) | |
| 11 | en0 9052 | . . . 4 ⊢ (2o ≈ ∅ ↔ 2o = ∅) | |
| 12 | 9, 10, 11 | 3bitr3g 316 | . . 3 ⊢ (𝐹 ∈ 𝑅 → (dom (𝐹 ∖ I ) = ∅ ↔ 2o = ∅)) |
| 13 | 12 | necon3bid 2999 | . 2 ⊢ (𝐹 ∈ 𝑅 → (dom (𝐹 ∖ I ) ≠ ∅ ↔ 2o ≠ ∅)) |
| 14 | 1, 13 | mpbiri 261 | 1 ⊢ (𝐹 ∈ 𝑅 → dom (𝐹 ∖ I ) ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 Vcvv 3450 ⊆ wss 3896 ∖ cdif 4044 ∅c0 4277 class class class wbr 5102 I cid 5545 dom cdm 5651 ran crn 5652 ‘cfv 6543 2oc2o 8477 ≈ cen 8977 pmTrspcpmtr 19664 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-om 7882 df-1o 8483 df-2o 8484 df-er 8724 df-en 8981 df-pmtr 19665 |
| This theorem is used by: psgnunilem3 19719 |
| Copyright terms: Public domain | W3C validator |