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

Theorem cicsym 16380
Description: Isomorphism is symmetric. (Contributed by AV, 5-Apr-2020.)
Assertion
Ref Expression
cicsym ((𝐶 ∈ Cat ∧ 𝑅( ≃𝑐𝐶)𝑆) → 𝑆( ≃𝑐𝐶)𝑅)

Proof of Theorem cicsym
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cicrcl 16379 . 2 ((𝐶 ∈ Cat ∧ 𝑅( ≃𝑐𝐶)𝑆) → 𝑆 ∈ (Base‘𝐶))
2 ciclcl 16378 . 2 ((𝐶 ∈ Cat ∧ 𝑅( ≃𝑐𝐶)𝑆) → 𝑅 ∈ (Base‘𝐶))
3 eqid 2626 . . . . 5 (Iso‘𝐶) = (Iso‘𝐶)
4 eqid 2626 . . . . 5 (Base‘𝐶) = (Base‘𝐶)
5 simpl 473 . . . . 5 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝐶 ∈ Cat)
6 simpr 477 . . . . . 6 ((𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶)) → 𝑅 ∈ (Base‘𝐶))
76adantl 482 . . . . 5 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝑅 ∈ (Base‘𝐶))
8 simpl 473 . . . . . 6 ((𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶)) → 𝑆 ∈ (Base‘𝐶))
98adantl 482 . . . . 5 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝑆 ∈ (Base‘𝐶))
103, 4, 5, 7, 9cic 16375 . . . 4 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑅( ≃𝑐𝐶)𝑆 ↔ ∃𝑓 𝑓 ∈ (𝑅(Iso‘𝐶)𝑆)))
11 eqid 2626 . . . . . . . . . . . 12 (Inv‘𝐶) = (Inv‘𝐶)
124, 11, 5, 7, 9, 3isoval 16341 . . . . . . . . . . 11 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑅(Iso‘𝐶)𝑆) = dom (𝑅(Inv‘𝐶)𝑆))
134, 11, 5, 9, 7invsym2 16339 . . . . . . . . . . . . . 14 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑆(Inv‘𝐶)𝑅) = (𝑅(Inv‘𝐶)𝑆))
1413eqcomd 2632 . . . . . . . . . . . . 13 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑅(Inv‘𝐶)𝑆) = (𝑆(Inv‘𝐶)𝑅))
1514dmeqd 5291 . . . . . . . . . . . 12 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → dom (𝑅(Inv‘𝐶)𝑆) = dom (𝑆(Inv‘𝐶)𝑅))
16 df-rn 5090 . . . . . . . . . . . 12 ran (𝑆(Inv‘𝐶)𝑅) = dom (𝑆(Inv‘𝐶)𝑅)
1715, 16syl6eqr 2678 . . . . . . . . . . 11 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → dom (𝑅(Inv‘𝐶)𝑆) = ran (𝑆(Inv‘𝐶)𝑅))
1812, 17eqtrd 2660 . . . . . . . . . 10 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑅(Iso‘𝐶)𝑆) = ran (𝑆(Inv‘𝐶)𝑅))
1918eleq2d 2689 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑓 ∈ (𝑅(Iso‘𝐶)𝑆) ↔ 𝑓 ∈ ran (𝑆(Inv‘𝐶)𝑅)))
20 vex 3194 . . . . . . . . . 10 𝑓 ∈ V
21 elrng 5279 . . . . . . . . . 10 (𝑓 ∈ V → (𝑓 ∈ ran (𝑆(Inv‘𝐶)𝑅) ↔ ∃𝑔 𝑔(𝑆(Inv‘𝐶)𝑅)𝑓))
2220, 21mp1i 13 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑓 ∈ ran (𝑆(Inv‘𝐶)𝑅) ↔ ∃𝑔 𝑔(𝑆(Inv‘𝐶)𝑅)𝑓))
2319, 22bitrd 268 . . . . . . . 8 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑓 ∈ (𝑅(Iso‘𝐶)𝑆) ↔ ∃𝑔 𝑔(𝑆(Inv‘𝐶)𝑅)𝑓))
24 df-br 4619 . . . . . . . . . 10 (𝑔(𝑆(Inv‘𝐶)𝑅)𝑓 ↔ ⟨𝑔, 𝑓⟩ ∈ (𝑆(Inv‘𝐶)𝑅))
2524exbii 1772 . . . . . . . . 9 (∃𝑔 𝑔(𝑆(Inv‘𝐶)𝑅)𝑓 ↔ ∃𝑔𝑔, 𝑓⟩ ∈ (𝑆(Inv‘𝐶)𝑅))
26 vex 3194 . . . . . . . . . . . . 13 𝑔 ∈ V
2726, 20opeldm 5293 . . . . . . . . . . . 12 (⟨𝑔, 𝑓⟩ ∈ (𝑆(Inv‘𝐶)𝑅) → 𝑔 ∈ dom (𝑆(Inv‘𝐶)𝑅))
284, 11, 5, 9, 7, 3isoval 16341 . . . . . . . . . . . . . . . 16 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑆(Iso‘𝐶)𝑅) = dom (𝑆(Inv‘𝐶)𝑅))
2928eqcomd 2632 . . . . . . . . . . . . . . 15 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → dom (𝑆(Inv‘𝐶)𝑅) = (𝑆(Iso‘𝐶)𝑅))
3029eleq2d 2689 . . . . . . . . . . . . . 14 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑔 ∈ dom (𝑆(Inv‘𝐶)𝑅) ↔ 𝑔 ∈ (𝑆(Iso‘𝐶)𝑅)))
315adantr 481 . . . . . . . . . . . . . . . 16 (((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) ∧ 𝑔 ∈ (𝑆(Iso‘𝐶)𝑅)) → 𝐶 ∈ Cat)
329adantr 481 . . . . . . . . . . . . . . . 16 (((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) ∧ 𝑔 ∈ (𝑆(Iso‘𝐶)𝑅)) → 𝑆 ∈ (Base‘𝐶))
337adantr 481 . . . . . . . . . . . . . . . 16 (((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) ∧ 𝑔 ∈ (𝑆(Iso‘𝐶)𝑅)) → 𝑅 ∈ (Base‘𝐶))
34 simpr 477 . . . . . . . . . . . . . . . 16 (((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) ∧ 𝑔 ∈ (𝑆(Iso‘𝐶)𝑅)) → 𝑔 ∈ (𝑆(Iso‘𝐶)𝑅))
353, 4, 31, 32, 33, 34brcici 16376 . . . . . . . . . . . . . . 15 (((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) ∧ 𝑔 ∈ (𝑆(Iso‘𝐶)𝑅)) → 𝑆( ≃𝑐𝐶)𝑅)
3635ex 450 . . . . . . . . . . . . . 14 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑔 ∈ (𝑆(Iso‘𝐶)𝑅) → 𝑆( ≃𝑐𝐶)𝑅))
3730, 36sylbid 230 . . . . . . . . . . . . 13 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑔 ∈ dom (𝑆(Inv‘𝐶)𝑅) → 𝑆( ≃𝑐𝐶)𝑅))
3837com12 32 . . . . . . . . . . . 12 (𝑔 ∈ dom (𝑆(Inv‘𝐶)𝑅) → ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝑆( ≃𝑐𝐶)𝑅))
3927, 38syl 17 . . . . . . . . . . 11 (⟨𝑔, 𝑓⟩ ∈ (𝑆(Inv‘𝐶)𝑅) → ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝑆( ≃𝑐𝐶)𝑅))
4039exlimiv 1860 . . . . . . . . . 10 (∃𝑔𝑔, 𝑓⟩ ∈ (𝑆(Inv‘𝐶)𝑅) → ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝑆( ≃𝑐𝐶)𝑅))
4140com12 32 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (∃𝑔𝑔, 𝑓⟩ ∈ (𝑆(Inv‘𝐶)𝑅) → 𝑆( ≃𝑐𝐶)𝑅))
4225, 41syl5bi 232 . . . . . . . 8 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (∃𝑔 𝑔(𝑆(Inv‘𝐶)𝑅)𝑓𝑆( ≃𝑐𝐶)𝑅))
4323, 42sylbid 230 . . . . . . 7 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑓 ∈ (𝑅(Iso‘𝐶)𝑆) → 𝑆( ≃𝑐𝐶)𝑅))
4443com12 32 . . . . . 6 (𝑓 ∈ (𝑅(Iso‘𝐶)𝑆) → ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝑆( ≃𝑐𝐶)𝑅))
4544exlimiv 1860 . . . . 5 (∃𝑓 𝑓 ∈ (𝑅(Iso‘𝐶)𝑆) → ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → 𝑆( ≃𝑐𝐶)𝑅))
4645com12 32 . . . 4 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (∃𝑓 𝑓 ∈ (𝑅(Iso‘𝐶)𝑆) → 𝑆( ≃𝑐𝐶)𝑅))
4710, 46sylbid 230 . . 3 ((𝐶 ∈ Cat ∧ (𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶))) → (𝑅( ≃𝑐𝐶)𝑆𝑆( ≃𝑐𝐶)𝑅))
4847impancom 456 . 2 ((𝐶 ∈ Cat ∧ 𝑅( ≃𝑐𝐶)𝑆) → ((𝑆 ∈ (Base‘𝐶) ∧ 𝑅 ∈ (Base‘𝐶)) → 𝑆( ≃𝑐𝐶)𝑅))
491, 2, 48mp2and 714 1 ((𝐶 ∈ Cat ∧ 𝑅( ≃𝑐𝐶)𝑆) → 𝑆( ≃𝑐𝐶)𝑅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  wex 1701  wcel 1992  Vcvv 3191  cop 4159   class class class wbr 4618  ccnv 5078  dom cdm 5079  ran crn 5080  cfv 5850  (class class class)co 6605  Basecbs 15776  Catccat 16241  Invcinv 16321  Isociso 16322  𝑐 ccic 16371
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-8 1994  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6903
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-ne 2797  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3193  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-iota 5813  df-fun 5852  df-fn 5853  df-f 5854  df-f1 5855  df-fo 5856  df-f1o 5857  df-fv 5858  df-ov 6608  df-oprab 6609  df-mpt2 6610  df-1st 7116  df-2nd 7117  df-supp 7242  df-sect 16323  df-inv 16324  df-iso 16325  df-cic 16372
This theorem is referenced by:  cicer  16382  initoeu2  16582
  Copyright terms: Public domain W3C validator