Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  2oppf Structured version   Visualization version   GIF version

Theorem 2oppf 49938
Description: The double opposite functor is the original functor. Remark 3.42 of [Adamek] p. 39. (Contributed by Zhi Wang, 14-Nov-2025.)
Hypotheses
Ref Expression
oppfrcl.1 (𝜑𝐺𝑅)
oppfrcl.2 Rel 𝑅
oppfrcl.3 𝐺 = ( oppFunc ‘𝐹)
Assertion
Ref Expression
2oppf (𝜑 → ( oppFunc ‘𝐺) = 𝐹)

Proof of Theorem 2oppf
StepHypRef Expression
1 fvex 6894 . . 3 (1st𝐹) ∈ V
2 fvex 6894 . . . 4 (2nd𝐹) ∈ V
32tposex 8254 . . 3 tpos (2nd𝐹) ∈ V
4 oppfvalg 49932 . . 3 (((1st𝐹) ∈ V ∧ tpos (2nd𝐹) ∈ V) → ((1st𝐹) oppFunc tpos (2nd𝐹)) = if((Rel tpos (2nd𝐹) ∧ Rel dom tpos (2nd𝐹)), ⟨(1st𝐹), tpos tpos (2nd𝐹)⟩, ∅))
51, 3, 4mp2an 704 . 2 ((1st𝐹) oppFunc tpos (2nd𝐹)) = if((Rel tpos (2nd𝐹) ∧ Rel dom tpos (2nd𝐹)), ⟨(1st𝐹), tpos tpos (2nd𝐹)⟩, ∅)
6 df-ov 7415 . . 3 ((1st𝐹) oppFunc tpos (2nd𝐹)) = ( oppFunc ‘⟨(1st𝐹), tpos (2nd𝐹)⟩)
7 oppfrcl.1 . . . . . 6 (𝜑𝐺𝑅)
8 oppfrcl.2 . . . . . 6 Rel 𝑅
9 oppfrcl.3 . . . . . 6 𝐺 = ( oppFunc ‘𝐹)
107, 8, 9oppfrcl 49934 . . . . . . 7 (𝜑𝐹 ∈ (V × V))
11 1st2nd2 8023 . . . . . . 7 (𝐹 ∈ (V × V) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
1210, 11syl 18 . . . . . 6 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
137, 8, 9, 12oppf1st2nd 49937 . . . . 5 (𝜑 → (𝐺 ∈ (V × V) ∧ ((1st𝐺) = (1st𝐹) ∧ (2nd𝐺) = tpos (2nd𝐹))))
14 eqopi 8020 . . . . 5 ((𝐺 ∈ (V × V) ∧ ((1st𝐺) = (1st𝐹) ∧ (2nd𝐺) = tpos (2nd𝐹))) → 𝐺 = ⟨(1st𝐹), tpos (2nd𝐹)⟩)
1513, 14syl 18 . . . 4 (𝜑𝐺 = ⟨(1st𝐹), tpos (2nd𝐹)⟩)
1615fveq2d 6885 . . 3 (𝜑 → ( oppFunc ‘𝐺) = ( oppFunc ‘⟨(1st𝐹), tpos (2nd𝐹)⟩))
176, 16eqtr4id 2816 . 2 (𝜑 → ((1st𝐹) oppFunc tpos (2nd𝐹)) = ( oppFunc ‘𝐺))
187, 8, 9, 12oppfrcl3 49936 . . . . 5 (𝜑 → (Rel (2nd𝐹) ∧ Rel dom (2nd𝐹)))
19 tpostpos2 8241 . . . . 5 ((Rel (2nd𝐹) ∧ Rel dom (2nd𝐹)) → tpos tpos (2nd𝐹) = (2nd𝐹))
2018, 19syl 18 . . . 4 (𝜑 → tpos tpos (2nd𝐹) = (2nd𝐹))
2120opeq2d 4844 . . 3 (𝜑 → ⟨(1st𝐹), tpos tpos (2nd𝐹)⟩ = ⟨(1st𝐹), (2nd𝐹)⟩)
22 0nelrel0 5720 . . . . . . 7 (Rel dom (2nd𝐹) → ¬ ∅ ∈ dom (2nd𝐹))
2318, 22simpl2im 512 . . . . . 6 (𝜑 → ¬ ∅ ∈ dom (2nd𝐹))
24 reldmtpos 8228 . . . . . 6 (Rel dom tpos (2nd𝐹) ↔ ¬ ∅ ∈ dom (2nd𝐹))
2523, 24sylibr 237 . . . . 5 (𝜑 → Rel dom tpos (2nd𝐹))
26 reltpos 8225 . . . . 5 Rel tpos (2nd𝐹)
2725, 26jctil 528 . . . 4 (𝜑 → (Rel tpos (2nd𝐹) ∧ Rel dom tpos (2nd𝐹)))
2827iftrued 4494 . . 3 (𝜑 → if((Rel tpos (2nd𝐹) ∧ Rel dom tpos (2nd𝐹)), ⟨(1st𝐹), tpos tpos (2nd𝐹)⟩, ∅) = ⟨(1st𝐹), tpos tpos (2nd𝐹)⟩)
2921, 28, 123eqtr4d 2807 . 2 (𝜑 → if((Rel tpos (2nd𝐹) ∧ Rel dom tpos (2nd𝐹)), ⟨(1st𝐹), tpos tpos (2nd𝐹)⟩, ∅) = 𝐹)
305, 17, 293eqtr3a 2821 1 (𝜑 → ( oppFunc ‘𝐺) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 400   = wceq 1569  wcel 2142  Vcvv 3454  c0 4285  ifcif 4486  cop 4594   × cxp 5658  dom cdm 5660  Rel wrel 5665  cfv 6536  (class class class)co 7412  1st c1st 7982  2nd c2nd 7983  tpos ctpos 8219   oppFunc coppf 49928
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-tpos 8220  df-oppf 49929
This theorem is used by:  oppff1  49954  oppff1o  49955  natoppfb  50037  cmddu  50474
  Copyright terms: Public domain W3C validator