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

Theorem invffval 17965
Description: Value of the inverse relation. (Contributed by Mario Carneiro, 2-Jan-2017.) Removed redundant hypotheses. (Revised by Zhi Wang, 27-Oct-2025.)
Hypotheses
Ref Expression
invfval.b 𝐵 = (Base‘𝐶)
invfval.n 𝑁 = (Inv‘𝐶)
invfval.c (𝜑 → 𝐶 ∈ Cat)
invffval.s 𝑆 = (Sect‘𝐶)
Assertion
Ref Expression
invffval (𝜑 → 𝑁 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
Distinct variable groups:   𝑥,𝑦,𝐵   𝜑,𝑥,𝑦   𝑥,𝐶,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝑁(𝑥, 𝑦)

Proof of Theorem invffval
Dummy variable 𝑐 is distinct from all other variables.
StepHypRef Expression
1 invfval.n . 2 𝑁 = (Inv‘𝐶)
2 invfval.c . . 3 (𝜑 → 𝐶 ∈ Cat)
3 fveq2 6911 . . . . . 6 (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
4 invfval.b . . . . . 6 𝐵 = (Base‘𝐶)
53, 4eqtr4di 2816 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
6 fveq2 6911 . . . . . . . 8 (𝑐 = 𝐶 → (Sect‘𝑐) = (Sect‘𝐶))
7 invffval.s . . . . . . . 8 𝑆 = (Sect‘𝐶)
86, 7eqtr4di 2816 . . . . . . 7 (𝑐 = 𝐶 → (Sect‘𝑐) = 𝑆)
98oveqd 7463 . . . . . 6 (𝑐 = 𝐶 → (𝑥(Sect‘𝑐)𝑦) = (𝑥𝑆𝑦))
108oveqd 7463 . . . . . . 7 (𝑐 = 𝐶 → (𝑦(Sect‘𝑐)𝑥) = (𝑦𝑆𝑥))
1110cnveqd 5861 . . . . . 6 (𝑐 = 𝐶 → ◡(𝑦(Sect‘𝑐)𝑥) = ◡(𝑦𝑆𝑥))
129, 11ineq12d 4121 . . . . 5 (𝑐 = 𝐶 → ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥)) = ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥)))
135, 5, 12mpoeq123dv 7521 . . . 4 (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
14 df-inv 17955 . . . 4 Inv = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))))
154fvexi 6925 . . . . 5 𝐵 ∈ V
1615, 15mpoex 8120 . . . 4 (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))) ∈ V
1713, 14, 16fvmpt 7019 . . 3 (𝐶 ∈ Cat → (Inv‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
182, 17syl 18 . 2 (𝜑 → (Inv‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
191, 18eqtrid 2810 1 (𝜑 → 𝑁 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ∩ cin 4092  ◡ccnv 5655  ‘cfv 6561  (class class class)co 7446   ∈ cmpo 7448  Basecbs 17419  Catccat 17870  Sectcsect 17951  Invcinv 17952
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-inv 17955
This theorem is used by:  invfval  17966  isoval  17972  invrcl2  50354  invpropdlem  50367
  Copyright terms: Public domain W3C validator