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

Theorem invffval 17913
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 6877 . . . . . 6 (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
4 invfval.b . . . . . 6 𝐵 = (Base‘𝐶)
53, 4eqtr4di 2814 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
6 fveq2 6877 . . . . . . . 8 (𝑐 = 𝐶 → (Sect‘𝑐) = (Sect‘𝐶))
7 invffval.s . . . . . . . 8 𝑆 = (Sect‘𝐶)
86, 7eqtr4di 2814 . . . . . . 7 (𝑐 = 𝐶 → (Sect‘𝑐) = 𝑆)
98oveqd 7429 . . . . . 6 (𝑐 = 𝐶 → (𝑥(Sect‘𝑐)𝑦) = (𝑥𝑆𝑦))
108oveqd 7429 . . . . . . 7 (𝑐 = 𝐶 → (𝑦(Sect‘𝑐)𝑥) = (𝑦𝑆𝑥))
1110cnveqd 5853 . . . . . 6 (𝑐 = 𝐶 → ◡(𝑦(Sect‘𝑐)𝑥) = ◡(𝑦𝑆𝑥))
129, 11ineq12d 4167 . . . . 5 (𝑐 = 𝐶 → ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥)) = ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥)))
135, 5, 12mpoeq123dv 7487 . . . 4 (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
14 df-inv 17903 . . . 4 Inv = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))))
154fvexi 6891 . . . . 5 𝐵 ∈ V
1615, 15mpoex 8081 . . . 4 (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))) ∈ V
1713, 14, 16fvmpt 6985 . . 3 (𝐶 ∈ Cat → (Inv‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
182, 17syl 18 . 2 (𝜑 → (Inv‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
191, 18eqtrid 2808 1 (𝜑 → 𝑁 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝑆𝑦) ∩ ◡(𝑦𝑆𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ∩ cin 3898  ◡ccnv 5650  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  Basecbs 17367  Catccat 17818  Sectcsect 17899  Invcinv 17900
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-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-inv 17903
This theorem is used by:  invfval  17914  isoval  17920  invrcl2  50077  invpropdlem  50090
  Copyright terms: Public domain W3C validator