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

Theorem pmtrdifel 19596
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 2765 . . . 4 ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))
41, 2, 3pmtrdifellem1 19592 . . 3 (𝑡𝑇 → ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) ∈ 𝑅)
51, 2, 3pmtrdifellem3 19594 . . 3 (𝑡𝑇 → ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥))
6 fveq1 6884 . . . . . 6 (𝑟 = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) → (𝑟𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥))
76eqeq2d 2776 . . . . 5 (𝑟 = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) → ((𝑡𝑥) = (𝑟𝑥) ↔ (𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥)))
87ralbidv 3190 . . . 4 (𝑟 = ((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) → (∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥) ↔ ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥)))
98rspcev 3583 . . 3 ((((pmTrsp‘𝑁)‘dom (𝑡 ∖ I )) ∈ 𝑅 ∧ ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (((pmTrsp‘𝑁)‘dom (𝑡 ∖ I ))‘𝑥)) → ∃𝑟𝑅𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥))
104, 5, 9syl2anc 596 . 2 (𝑡𝑇 → ∃𝑟𝑅𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥))
1110rgen 3083 1 𝑡𝑇𝑟𝑅𝑥 ∈ (𝑁 ∖ {𝐾})(𝑡𝑥) = (𝑟𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2146  wral 3081  wrex 3091  cdif 3903  {csn 4591   I cid 5557  dom cdm 5663  ran crn 5664  cfv 6540  pmTrspcpmtr 19557
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-om 7869  df-1o 8459  df-2o 8460  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-pmtr 19558
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator