Metamath Proof Explorer


Theorem swapf1vala

Description: The object part of the swap functor. See also swapf1val . (Contributed by Zhi Wang, 7-Oct-2025)

Ref Expression
Hypotheses swapfval.c ⊢ φ → C ∈ U
swapfval.d ⊢ φ → D ∈ V
swapf2fvala.s ⊢ S = C × c D
swapf2fvala.b ⊢ B = Base S
Assertion swapf1vala Could not format assertion : No typesetting found for |- ( ph -> ( 1st ` ( C swapF D ) ) = ( x e. B |-> U. `' { x } ) ) with typecode |-

Proof

Step Hyp Ref Expression
1 swapfval.c ⊢ φ → C ∈ U
2 swapfval.d ⊢ φ → D ∈ V
3 swapf2fvala.s ⊢ S = C × c D
4 swapf2fvala.b ⊢ B = Base S
5 eqidd ⊢ φ → Hom ⁡ S = Hom ⁡ S
6 1 2 3 4 5 swapfval Could not format ( ph -> ( C swapF D ) = <. ( x e. B |-> U. `' { x } ) , ( u e. B , v e. B |-> ( f e. ( u ( Hom ` S ) v ) |-> U. `' { f } ) ) >. ) : No typesetting found for |- ( ph -> ( C swapF D ) = <. ( x e. B |-> U. `' { x } ) , ( u e. B , v e. B |-> ( f e. ( u ( Hom ` S ) v ) |-> U. `' { f } ) ) >. ) with typecode |-
7 6 fveq2d Could not format ( ph -> ( 1st ` ( C swapF D ) ) = ( 1st ` <. ( x e. B |-> U. `' { x } ) , ( u e. B , v e. B |-> ( f e. ( u ( Hom ` S ) v ) |-> U. `' { f } ) ) >. ) ) : No typesetting found for |- ( ph -> ( 1st ` ( C swapF D ) ) = ( 1st ` <. ( x e. B |-> U. `' { x } ) , ( u e. B , v e. B |-> ( f e. ( u ( Hom ` S ) v ) |-> U. `' { f } ) ) >. ) ) with typecode |-
8 4 fvexi ⊢ B ∈ V
9 8 mptex ⊢ x ∈ B ⟼ ⋃ x -1 ∈ V
10 8 8 mpoex ⊢ u ∈ B , v ∈ B ⟼ f ∈ u Hom ⁡ S v ⟼ ⋃ f -1 ∈ V
11 9 10 op1st ⊢ 1 st ⁡ x ∈ B ⟼ ⋃ x -1 u ∈ B , v ∈ B ⟼ f ∈ u Hom ⁡ S v ⟼ ⋃ f -1 = x ∈ B ⟼ ⋃ x -1
12 7 11 eqtrdi Could not format ( ph -> ( 1st ` ( C swapF D ) ) = ( x e. B |-> U. `' { x } ) ) : No typesetting found for |- ( ph -> ( 1st ` ( C swapF D ) ) = ( x e. B |-> U. `' { x } ) ) with typecode |-