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

Theorem pmtrmvd 19365
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 19364 . . 3 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (𝑇𝑃):𝐷𝐷)
3 ffn 6716 . . 3 ((𝑇𝑃):𝐷𝐷 → (𝑇𝑃) Fn 𝐷)
4 fndifnfp 7175 . . 3 ((𝑇𝑃) Fn 𝐷 → dom ((𝑇𝑃) ∖ I ) = {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧})
52, 3, 43syl 18 . 2 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → dom ((𝑇𝑃) ∖ I ) = {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧})
61pmtrfv 19361 . . . . . 6 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → ((𝑇𝑃)‘𝑧) = if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧))
76neeq1d 2998 . . . . 5 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → (((𝑇𝑃)‘𝑧) ≠ 𝑧 ↔ if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧))
8 iffalse 4536 . . . . . . . 8 𝑧𝑃 → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) = 𝑧)
98necon1ai 2966 . . . . . . 7 (if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧𝑧𝑃)
10 iftrue 4533 . . . . . . . . . 10 (𝑧𝑃 → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) = (𝑃 ∖ {𝑧}))
1110adantl 480 . . . . . . . . 9 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) = (𝑃 ∖ {𝑧}))
12 1onn 8641 . . . . . . . . . . 11 1o ∈ ω
13 simpl3 1191 . . . . . . . . . . . 12 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → 𝑃 ≈ 2o)
14 df-2o 8469 . . . . . . . . . . . 12 2o = suc 1o
1513, 14breqtrdi 5188 . . . . . . . . . . 11 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → 𝑃 ≈ suc 1o)
16 simpr 483 . . . . . . . . . . 11 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → 𝑧𝑃)
17 dif1ennn 9163 . . . . . . . . . . 11 ((1o ∈ ω ∧ 𝑃 ≈ suc 1o𝑧𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
1812, 15, 16, 17mp3an2i 1464 . . . . . . . . . 10 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
19 en1uniel 9030 . . . . . . . . . 10 ((𝑃 ∖ {𝑧}) ≈ 1o (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}))
20 eldifsni 4792 . . . . . . . . . 10 ( (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}) → (𝑃 ∖ {𝑧}) ≠ 𝑧)
2118, 19, 203syl 18 . . . . . . . . 9 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → (𝑃 ∖ {𝑧}) ≠ 𝑧)
2211, 21eqnetrd 3006 . . . . . . . 8 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝑃) → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧)
2322ex 411 . . . . . . 7 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (𝑧𝑃 → if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧))
249, 23impbid2 225 . . . . . 6 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧𝑧𝑃))
2524adantr 479 . . . . 5 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → (if(𝑧𝑃, (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧𝑧𝑃))
267, 25bitrd 278 . . . 4 (((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) ∧ 𝑧𝐷) → (((𝑇𝑃)‘𝑧) ≠ 𝑧𝑧𝑃))
2726rabbidva 3437 . . 3 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧} = {𝑧𝐷𝑧𝑃})
28 incom 4200 . . . 4 (𝑃𝐷) = (𝐷𝑃)
29 dfin5 3955 . . . 4 (𝐷𝑃) = {𝑧𝐷𝑧𝑃}
3028, 29eqtri 2758 . . 3 (𝑃𝐷) = {𝑧𝐷𝑧𝑃}
3127, 30eqtr4di 2788 . 2 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → {𝑧𝐷 ∣ ((𝑇𝑃)‘𝑧) ≠ 𝑧} = (𝑃𝐷))
32 simp2 1135 . . 3 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → 𝑃𝐷)
33 df-ss 3964 . . 3 (𝑃𝐷 ↔ (𝑃𝐷) = 𝑃)
3432, 33sylib 217 . 2 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → (𝑃𝐷) = 𝑃)
355, 31, 343eqtrd 2774 1 ((𝐷𝑉𝑃𝐷𝑃 ≈ 2o) → dom ((𝑇𝑃) ∖ I ) = 𝑃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1085   = wceq 1539  wcel 2104  wne 2938  {crab 3430  cdif 3944  cin 3946  wss 3947  ifcif 4527  {csn 4627   cuni 4907   class class class wbr 5147   I cid 5572  dom cdm 5675  suc csuc 6365   Fn wfn 6537  wf 6538  cfv 6542  ωcom 7857  1oc1o 8461  2oc2o 8462  cen 8938  pmTrspcpmtr 19350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-om 7858  df-1o 8468  df-2o 8469  df-en 8942  df-pmtr 19351
This theorem is referenced by:  pmtrfrn  19367  pmtrfb  19374  symggen  19379  pmtrdifellem2  19386  mdetralt  22330  mdetunilem7  22340  pmtrcnel  32520  pmtrcnel2  32521
  Copyright terms: Public domain W3C validator