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

Theorem oppf1st2nd 50668
Description: Rewrite the opposite functor into its components (eqopi 8070). (Contributed by Zhi Wang, 14-Nov-2025.)
Hypotheses
Ref Expression
oppfrcl.1 (𝜑 → 𝐺 ∈ 𝑅)
oppfrcl.2 Rel 𝑅
oppfrcl.3 𝐺 = ( oppFunc ‘𝐹)
oppfrcl2.4 (𝜑 → 𝐹 = ⟨𝐴, 𝐵⟩)
Assertion
Ref Expression
oppf1st2nd (𝜑 → (𝐺 ∈ (V × V) ∧ ((1st ‘𝐺) = 𝐴 ∧ (2nd ‘𝐺) = tpos 𝐵)))

Proof of Theorem oppf1st2nd
StepHypRef Expression
1 oppfrcl2.4 . . . . . . 7 (𝜑 → 𝐹 = ⟨𝐴, 𝐵⟩)
21fveq2d 6919 . . . . . 6 (𝜑 → ( oppFunc ‘𝐹) = ( oppFunc ‘⟨𝐴, 𝐵⟩))
3 oppfrcl.3 . . . . . 6 𝐺 = ( oppFunc ‘𝐹)
4 df-ov 7453 . . . . . 6 (𝐴 oppFunc 𝐵) = ( oppFunc ‘⟨𝐴, 𝐵⟩)
52, 3, 43eqtr4g 2826 . . . . 5 (𝜑 → 𝐺 = (𝐴 oppFunc 𝐵))
6 oppfrcl.1 . . . . . . 7 (𝜑 → 𝐺 ∈ 𝑅)
7 oppfrcl.2 . . . . . . 7 Rel 𝑅
86, 7, 3, 1oppfrcl2 50666 . . . . . 6 (𝜑 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
9 oppfvalg 50663 . . . . . 6 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 oppFunc 𝐵) = if((Rel 𝐵 ∧ Rel dom 𝐵), ⟨𝐴, tpos 𝐵⟩, ∅))
108, 9syl 18 . . . . 5 (𝜑 → (𝐴 oppFunc 𝐵) = if((Rel 𝐵 ∧ Rel dom 𝐵), ⟨𝐴, tpos 𝐵⟩, ∅))
115, 10eqtrd 2801 . . . 4 (𝜑 → 𝐺 = if((Rel 𝐵 ∧ Rel dom 𝐵), ⟨𝐴, tpos 𝐵⟩, ∅))
126, 7, 3, 1oppfrcl3 50667 . . . . 5 (𝜑 → (Rel 𝐵 ∧ Rel dom 𝐵))
1312iftrued 4492 . . . 4 (𝜑 → if((Rel 𝐵 ∧ Rel dom 𝐵), ⟨𝐴, tpos 𝐵⟩, ∅) = ⟨𝐴, tpos 𝐵⟩)
1411, 13eqtrd 2801 . . 3 (𝜑 → 𝐺 = ⟨𝐴, tpos 𝐵⟩)
158simpld 500 . . . 4 (𝜑 → 𝐴 ∈ V)
16 tposexg 8294 . . . . 5 (𝐵 ∈ V → tpos 𝐵 ∈ V)
178, 16simpl2im 513 . . . 4 (𝜑 → tpos 𝐵 ∈ V)
1815, 17opelxpd 5696 . . 3 (𝜑 → ⟨𝐴, tpos 𝐵⟩ ∈ (V × V))
1914, 18eqeltrd 2867 . 2 (𝜑 → 𝐺 ∈ (V × V))
2014fveq2d 6919 . . 3 (𝜑 → (1st ‘𝐺) = (1st ‘⟨𝐴, tpos 𝐵⟩))
21 op1stg 8046 . . . 4 ((𝐴 ∈ V ∧ tpos 𝐵 ∈ V) → (1st ‘⟨𝐴, tpos 𝐵⟩) = 𝐴)
2215, 17, 21syl2anc 596 . . 3 (𝜑 → (1st ‘⟨𝐴, tpos 𝐵⟩) = 𝐴)
2320, 22eqtrd 2801 . 2 (𝜑 → (1st ‘𝐺) = 𝐴)
2414fveq2d 6919 . . 3 (𝜑 → (2nd ‘𝐺) = (2nd ‘⟨𝐴, tpos 𝐵⟩))
25 op2ndg 8047 . . . 4 ((𝐴 ∈ V ∧ tpos 𝐵 ∈ V) → (2nd ‘⟨𝐴, tpos 𝐵⟩) = tpos 𝐵)
2615, 17, 25syl2anc 596 . . 3 (𝜑 → (2nd ‘⟨𝐴, tpos 𝐵⟩) = tpos 𝐵)
2724, 26eqtrd 2801 . 2 (𝜑 → (2nd ‘𝐺) = tpos 𝐵)
2819, 23, 27jca32 525 1 (𝜑 → (𝐺 ∈ (V × V) ∧ ((1st ‘𝐺) = 𝐴 ∧ (2nd ‘𝐺) = tpos 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  Vcvv 3453  ∅c0 4280  ifcif 4484  ⟨cop 4839   × cxp 5655  dom cdm 5657  Rel wrel 5662  ‘cfv 6565  (class class class)co 7450  1st c1st 8032  2nd c2nd 8033  tpos ctpos 8279   oppFunc coppf 50659
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-tpos 8280  df-oppf 50660
This theorem is used by:  2oppf  50669  funcoppc4  50681
  Copyright terms: Public domain W3C validator