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

Theorem pmtrdifel 19449
Description: A transposition of elements of a set without a special element corresponds to a transposition of elements of the set. (Contributed by AV, 15-Jan-2019.)
Hypotheses
Ref Expression
pmtrdifel.t 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾}))
pmtrdifel.r 𝑅 = ran (pmTrsp‘𝑁)
Assertion
Ref Expression
pmtrdifel 𝑡𝑇𝑟𝑅𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥)
Distinct variable groups:   𝑡,𝑟,𝑥   𝐾,𝑟   𝑁,𝑟,𝑥   𝑅,𝑟   𝑥,𝑇
Allowed substitution hints:   𝑅(𝑥,𝑡)   𝑇(𝑡,𝑟)   𝐾(𝑥,𝑡)   𝑁(𝑡)

Proof of Theorem pmtrdifel
StepHypRef Expression
1 pmtrdifel.t . . . 4 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾}))
2 pmtrdifel.r . . . 4 𝑅 = ran (pmTrsp‘𝑁)
3 eqid 2737 . . . 4 ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))
41, 2, 3pmtrdifellem1 19445 . . 3 (𝑡𝑇 → ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) ∈ 𝑅)
51, 2, 3pmtrdifellem3 19447 . . 3 (𝑡𝑇 → ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥))
6 fveq1 6834 . . . . . 6 (𝑟 = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) → (𝑟𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥))
76eqeq2d 2748 . . . . 5 (𝑟 = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) → ((𝑡𝑥) = (𝑟𝑥) ↔ (𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥)))
87ralbidv 3161 . . . 4 (𝑟 = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) → (∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥) ↔ ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥)))
98rspcev 3565 . . 3 ((((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) ∈ 𝑅 ∧ ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥)) → ∃𝑟𝑅𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥))
104, 5, 9syl2anc 585 . 2 (𝑡𝑇 → ∃𝑟𝑅𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥))
1110rgen 3054 1 𝑡𝑇𝑟𝑅𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  wcel 2114  wral 3052  wrex 3062  cdif 3887  {csn 4568   I cid 5519  dom cdm 5625  ran crn 5626  cfv 6493  pmTrspcpmtr 19410
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-om 7812  df-1o 8399  df-2o 8400  df-er 8637  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-pmtr 19411
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator