MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pmtrmvd Structured version   Visualization version   GIF version

Theorem pmtrmvd 19489
Description: A transposition moves precisely the transposed points. (Contributed by Stefan O'Rear, 16-Aug-2015.)
Hypothesis
Ref Expression
pmtrfval.t 𝑇 = (pmTrsp‘𝐷)
Assertion
Ref Expression
pmtrmvd ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → dom ((𝑇𝑃) ∖ I ) = 𝑃)

Proof of Theorem pmtrmvd
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 pmtrfval.t . . . 4 𝑇 = (pmTrsp‘𝐷)
21pmtrf 19488 . . 3 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (𝑇𝑃):𝐷𝐷)
3 ffn 6737 . . 3 ((𝑇𝑃):𝐷𝐷 → (𝑇𝑃) Fn 𝐷)
4 fndifnfp 7196 . . 3 ((𝑇𝑃) Fn 𝐷 → dom ((𝑇𝑃) ∖ I ) = {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧})
52, 3, 43syl 18 . 2 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → dom ((𝑇𝑃) ∖ I ) = {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧})
61pmtrfv 19485 . . . . . 6 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → ((𝑇𝑃)‘𝑧) = if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧))
76neeq1d 2998 . . . . 5 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → (((𝑇𝑃)‘𝑧) ≠ 𝑧 ↔ if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧))
8 iffalse 4540 . . . . . . . 8 𝑧𝑃 → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) = 𝑧)
98necon1ai 2966 . . . . . . 7 (if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧𝑧𝑃)
10 iftrue 4537 . . . . . . . . . 10 (𝑧𝑃 → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) = (𝑃 ∖ {𝑧}))
1110adantl 481 . . . . . . . . 9 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) = (𝑃 ∖ {𝑧}))
12 1onn 8677 . . . . . . . . . . 11 1o ∈ ω
13 simpl3 1192 . . . . . . . . . . . 12 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → 𝑃 ≈ 2o)
14 df-2o 8506 . . . . . . . . . . . 12 2o = suc 1o
1513, 14breqtrdi 5189 . . . . . . . . . . 11 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → 𝑃 ≈ suc 1o)
16 simpr 484 . . . . . . . . . . 11 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → 𝑧𝑃)
17 dif1ennn 9200 . . . . . . . . . . 11 ((1o ∈ ω ∧ 𝑃 ≈ suc 1o𝑧𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
1812, 15, 16, 17mp3an2i 1465 . . . . . . . . . 10 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
19 en1uniel 9068 . . . . . . . . . 10 ((𝑃 ∖ {𝑧}) ≈ 1o (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}))
20 eldifsni 4795 . . . . . . . . . 10 ( (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}) → (𝑃 ∖ {𝑧}) ≠ 𝑧)
2118, 19, 203syl 18 . . . . . . . . 9 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → (𝑃 ∖ {𝑧}) ≠ 𝑧)
2211, 21eqnetrd 3006 . . . . . . . 8 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧)
2322ex 412 . . . . . . 7 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (𝑧𝑃 → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧))
249, 23impbid2 226 . . . . . 6 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧𝑧𝑃))
2524adantr 480 . . . . 5 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → (if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧𝑧𝑃))
267, 25bitrd 279 . . . 4 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → (((𝑇𝑃)‘𝑧) ≠ 𝑧𝑧𝑃))
2726rabbidva 3440 . . 3 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧} = {𝑧𝐷𝑧𝑃})
28 incom 4217 . . . 4 (𝑃𝐷) = (𝐷𝑃)
29 dfin5 3971 . . . 4 (𝐷𝑃) = {𝑧𝐷𝑧𝑃}
3028, 29eqtri 2763 . . 3 (𝑃𝐷) = {𝑧𝐷𝑧𝑃}
3127, 30eqtr4di 2793 . 2 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧} = (𝑃𝐷))
32 simp2 1136 . . 3 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → 𝑃𝐷)
33 dfss2 3981 . . 3 (𝑃𝐷 ↔ (𝑃𝐷) = 𝑃)
3432, 33sylib 218 . 2 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (𝑃𝐷) = 𝑃)
355, 31, 343eqtrd 2779 1 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → dom ((𝑇𝑃) ∖ I ) = 𝑃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1537  wcel 2106  wne 2938  {crab 3433  cdif 3960  cin 3962  wss 3963  ifcif 4531  {csn 4631   cuni 4912   class class class wbr 5148   I cid 5582  dom cdm 5689  suc csuc 6388   Fn wfn 6558  wf 6559  cfv 6563  ωcom 7887  1oc1o 8498  2oc2o 8499  cen 8981  pmTrspcpmtr 19474
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-om 7888  df-1o 8505  df-2o 8506  df-en 8985  df-pmtr 19475
This theorem is referenced by:  pmtrfrn  19491  pmtrfb  19498  symggen  19503  pmtrdifellem2  19510  mdetralt  22630  mdetunilem7  22640  pmtrcnel  33092  pmtrcnel2  33093
  Copyright terms: Public domain W3C validator