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

Theorem f1omvdcnv 19638
Description: A permutation and its inverse move the same points. (Contributed by Stefan O'Rear, 22-Aug-2015.)
Assertion
Ref Expression
f1omvdcnv (𝐹:𝐴–1-1-onto→𝐴 → dom (◡𝐹 ∖ I ) = dom (𝐹 ∖ I ))

Proof of Theorem f1omvdcnv
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 f1ocnvfvb 7279 . . . . . 6 ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑥 ↔ (◡𝐹‘𝑥) = 𝑥))
213anidm23 1448 . . . . 5 ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑥 ↔ (◡𝐹‘𝑥) = 𝑥))
32bicomd 226 . . . 4 ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝑥) = 𝑥 ↔ (𝐹‘𝑥) = 𝑥))
43necon3bid 3000 . . 3 ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝑥) ≠ 𝑥 ↔ (𝐹‘𝑥) ≠ 𝑥))
54rabbidva 3419 . 2 (𝐹:𝐴–1-1-onto→𝐴 → {𝑥 ∈ 𝐴 ∣ (◡𝐹‘𝑥) ≠ 𝑥} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥})
6 f1ocnv 6829 . . 3 (𝐹:𝐴–1-1-onto→𝐴 → ◡𝐹:𝐴–1-1-onto→𝐴)
7 f1ofn 6817 . . 3 (◡𝐹:𝐴–1-1-onto→𝐴 → ◡𝐹 Fn 𝐴)
8 fndifnfp 7173 . . 3 (◡𝐹 Fn 𝐴 → dom (◡𝐹 ∖ I ) = {𝑥 ∈ 𝐴 ∣ (◡𝐹‘𝑥) ≠ 𝑥})
96, 7, 83syl 19 . 2 (𝐹:𝐴–1-1-onto→𝐴 → dom (◡𝐹 ∖ I ) = {𝑥 ∈ 𝐴 ∣ (◡𝐹‘𝑥) ≠ 𝑥})
10 f1ofn 6817 . . 3 (𝐹:𝐴–1-1-onto→𝐴 → 𝐹 Fn 𝐴)
11 fndifnfp 7173 . . 3 (𝐹 Fn 𝐴 → dom (𝐹 ∖ I ) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥})
1210, 11syl 18 . 2 (𝐹:𝐴–1-1-onto→𝐴 → dom (𝐹 ∖ I ) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥})
135, 9, 123eqtr4d 2806 1 (𝐹:𝐴–1-1-onto→𝐴 → dom (◡𝐹 ∖ I ) = dom (𝐹 ∖ I ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  {crab 3413   ∖ cdif 3896   I cid 5545  ◡ccnv 5650  dom cdm 5651   Fn wfn 6526  –1-1-onto→wf1o 6530  ‘cfv 6531
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  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-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539
This theorem is used by:  f1omvdco2  19642  symgsssg  19661  symgfisg  19662
  Copyright terms: Public domain W3C validator