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

Theorem fvcosymgeq 18536
Description: The values of two compositions of permutations are equal if the values of the composed permutations are pairwise equal. (Contributed by AV, 26-Jan-2019.)
Hypotheses
Ref Expression
gsmsymgrfix.s 𝑆 = (SymGrp‘𝑁)
gsmsymgrfix.b 𝐵 = (Base‘𝑆)
gsmsymgreq.z 𝑍 = (SymGrp‘𝑀)
gsmsymgreq.p 𝑃 = (Base‘𝑍)
gsmsymgreq.i 𝐼 = (𝑁𝑀)
Assertion
Ref Expression
fvcosymgeq ((𝐺𝐵𝐾𝑃) → ((𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛)) → ((𝐹𝐺)‘𝑋) = ((𝐻𝐾)‘𝑋)))
Distinct variable groups:   𝑛,𝐹   𝑛,𝐺   𝑛,𝐻   𝑛,𝐼   𝑛,𝐾   𝑛,𝑋
Allowed substitution hints:   𝐵(𝑛)   𝑃(𝑛)   𝑆(𝑛)   𝑀(𝑛)   𝑁(𝑛)   𝑍(𝑛)

Proof of Theorem fvcosymgeq
StepHypRef Expression
1 gsmsymgrfix.s . . . . . . 7 𝑆 = (SymGrp‘𝑁)
2 gsmsymgrfix.b . . . . . . 7 𝐵 = (Base‘𝑆)
31, 2symgbasf 18483 . . . . . 6 (𝐺𝐵𝐺:𝑁𝑁)
43ffnd 6491 . . . . 5 (𝐺𝐵𝐺 Fn 𝑁)
5 gsmsymgreq.z . . . . . . 7 𝑍 = (SymGrp‘𝑀)
6 gsmsymgreq.p . . . . . . 7 𝑃 = (Base‘𝑍)
75, 6symgbasf 18483 . . . . . 6 (𝐾𝑃𝐾:𝑀𝑀)
87ffnd 6491 . . . . 5 (𝐾𝑃𝐾 Fn 𝑀)
94, 8anim12i 614 . . . 4 ((𝐺𝐵𝐾𝑃) → (𝐺 Fn 𝑁𝐾 Fn 𝑀))
109adantr 483 . . 3 (((𝐺𝐵𝐾𝑃) ∧ (𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛))) → (𝐺 Fn 𝑁𝐾 Fn 𝑀))
11 gsmsymgreq.i . . . . . . . 8 𝐼 = (𝑁𝑀)
1211eleq2i 2902 . . . . . . 7 (𝑋𝐼𝑋 ∈ (𝑁𝑀))
1312biimpi 218 . . . . . 6 (𝑋𝐼𝑋 ∈ (𝑁𝑀))
14133ad2ant1 1129 . . . . 5 ((𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛)) → 𝑋 ∈ (𝑁𝑀))
1514adantl 484 . . . 4 (((𝐺𝐵𝐾𝑃) ∧ (𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛))) → 𝑋 ∈ (𝑁𝑀))
16 simpr2 1191 . . . 4 (((𝐺𝐵𝐾𝑃) ∧ (𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛))) → (𝐺𝑋) = (𝐾𝑋))
171, 2symgbasf1o 18482 . . . . . . . . . . 11 (𝐺𝐵𝐺:𝑁1-1-onto𝑁)
18 dff1o5 6600 . . . . . . . . . . . 12 (𝐺:𝑁1-1-onto𝑁 ↔ (𝐺:𝑁1-1𝑁 ∧ ran 𝐺 = 𝑁))
19 eqcom 2827 . . . . . . . . . . . . 13 (ran 𝐺 = 𝑁𝑁 = ran 𝐺)
2019biimpi 218 . . . . . . . . . . . 12 (ran 𝐺 = 𝑁𝑁 = ran 𝐺)
2118, 20simplbiim 507 . . . . . . . . . . 11 (𝐺:𝑁1-1-onto𝑁𝑁 = ran 𝐺)
2217, 21syl 17 . . . . . . . . . 10 (𝐺𝐵𝑁 = ran 𝐺)
235, 6symgbasf1o 18482 . . . . . . . . . . 11 (𝐾𝑃𝐾:𝑀1-1-onto𝑀)
24 dff1o5 6600 . . . . . . . . . . . 12 (𝐾:𝑀1-1-onto𝑀 ↔ (𝐾:𝑀1-1𝑀 ∧ ran 𝐾 = 𝑀))
25 eqcom 2827 . . . . . . . . . . . . 13 (ran 𝐾 = 𝑀𝑀 = ran 𝐾)
2625biimpi 218 . . . . . . . . . . . 12 (ran 𝐾 = 𝑀𝑀 = ran 𝐾)
2724, 26simplbiim 507 . . . . . . . . . . 11 (𝐾:𝑀1-1-onto𝑀𝑀 = ran 𝐾)
2823, 27syl 17 . . . . . . . . . 10 (𝐾𝑃𝑀 = ran 𝐾)
2922, 28ineqan12d 4169 . . . . . . . . 9 ((𝐺𝐵𝐾𝑃) → (𝑁𝑀) = (ran 𝐺 ∩ ran 𝐾))
3011, 29syl5eq 2867 . . . . . . . 8 ((𝐺𝐵𝐾𝑃) → 𝐼 = (ran 𝐺 ∩ ran 𝐾))
3130raleqdv 3398 . . . . . . 7 ((𝐺𝐵𝐾𝑃) → (∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛) ↔ ∀𝑛 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹𝑛) = (𝐻𝑛)))
3231biimpcd 251 . . . . . 6 (∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛) → ((𝐺𝐵𝐾𝑃) → ∀𝑛 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹𝑛) = (𝐻𝑛)))
33323ad2ant3 1131 . . . . 5 ((𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛)) → ((𝐺𝐵𝐾𝑃) → ∀𝑛 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹𝑛) = (𝐻𝑛)))
3433impcom 410 . . . 4 (((𝐺𝐵𝐾𝑃) ∧ (𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛))) → ∀𝑛 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹𝑛) = (𝐻𝑛))
3515, 16, 343jca 1124 . . 3 (((𝐺𝐵𝐾𝑃) ∧ (𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛))) → (𝑋 ∈ (𝑁𝑀) ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹𝑛) = (𝐻𝑛)))
36 fvcofneq 6835 . . 3 ((𝐺 Fn 𝑁𝐾 Fn 𝑀) → ((𝑋 ∈ (𝑁𝑀) ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹𝑛) = (𝐻𝑛)) → ((𝐹𝐺)‘𝑋) = ((𝐻𝐾)‘𝑋)))
3710, 35, 36sylc 65 . 2 (((𝐺𝐵𝐾𝑃) ∧ (𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛))) → ((𝐹𝐺)‘𝑋) = ((𝐻𝐾)‘𝑋))
3837ex 415 1 ((𝐺𝐵𝐾𝑃) → ((𝑋𝐼 ∧ (𝐺𝑋) = (𝐾𝑋) ∧ ∀𝑛𝐼 (𝐹𝑛) = (𝐻𝑛)) → ((𝐹𝐺)‘𝑋) = ((𝐻𝐾)‘𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  wral 3125  cin 3912  ran crn 5532  ccom 5535   Fn wfn 6326  1-1wf1 6328  1-1-ontowf1o 6330  cfv 6331  Basecbs 16462  SymGrpcsymg 18474
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439  ax-cnex 10571  ax-resscn 10572  ax-1cn 10573  ax-icn 10574  ax-addcl 10575  ax-addrcl 10576  ax-mulcl 10577  ax-mulrcl 10578  ax-mulcom 10579  ax-addass 10580  ax-mulass 10581  ax-distr 10582  ax-i2m1 10583  ax-1ne0 10584  ax-1rid 10585  ax-rnegex 10586  ax-rrecex 10587  ax-cnre 10588  ax-pre-lttri 10589  ax-pre-lttrn 10590  ax-pre-ltadd 10591  ax-pre-mulgt0 10592
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-nel 3111  df-ral 3130  df-rex 3131  df-reu 3132  df-rab 3134  df-v 3475  df-sbc 3753  df-csb 3861  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4270  df-if 4444  df-pw 4517  df-sn 4544  df-pr 4546  df-tp 4548  df-op 4550  df-uni 4815  df-int 4853  df-iun 4897  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5436  df-eprel 5441  df-po 5450  df-so 5451  df-fr 5490  df-we 5492  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-ima 5544  df-pred 6124  df-ord 6170  df-on 6171  df-lim 6172  df-suc 6173  df-iota 6290  df-fun 6333  df-fn 6334  df-f 6335  df-f1 6336  df-fo 6337  df-f1o 6338  df-fv 6339  df-riota 7091  df-ov 7136  df-oprab 7137  df-mpo 7138  df-om 7559  df-1st 7667  df-2nd 7668  df-wrecs 7925  df-recs 7986  df-rdg 8024  df-1o 8080  df-oadd 8084  df-er 8267  df-map 8386  df-en 8488  df-dom 8489  df-sdom 8490  df-fin 8491  df-pnf 10655  df-mnf 10656  df-xr 10657  df-ltxr 10658  df-le 10659  df-sub 10850  df-neg 10851  df-nn 11617  df-2 11679  df-3 11680  df-4 11681  df-5 11682  df-6 11683  df-7 11684  df-8 11685  df-9 11686  df-n0 11877  df-z 11961  df-uz 12223  df-fz 12877  df-struct 16464  df-ndx 16465  df-slot 16466  df-base 16468  df-sets 16469  df-ress 16470  df-plusg 16557  df-tset 16563  df-efmnd 18013  df-symg 18475
This theorem is referenced by:  gsmsymgreqlem1  18537
  Copyright terms: Public domain W3C validator