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

Theorem eloppf2 49716
Description: Both components of a pre-image of a non-empty opposite functor exist; and the second component is a relation on triples. (Contributed by Zhi Wang, 18-Nov-2025.)
Hypotheses
Ref Expression
eloppf2.k (𝐹 oppFunc 𝐺) = 𝐾
eloppf2.x (𝜑𝑋𝐾)
Assertion
Ref Expression
eloppf2 (𝜑 → ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Rel 𝐺 ∧ Rel dom 𝐺)))

Proof of Theorem eloppf2
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eloppf2.x . . . 4 (𝜑𝑋𝐾)
2 eloppf2.k . . . 4 (𝐹 oppFunc 𝐺) = 𝐾
31, 2eleqtrrdi 2872 . . 3 (𝜑𝑋 ∈ (𝐹 oppFunc 𝐺))
4 df-oppf 49705 . . . 4 oppFunc = (𝑓 ∈ V, 𝑔 ∈ V ↦ if((Rel 𝑔 ∧ Rel dom 𝑔), ⟨𝑓, tpos 𝑔⟩, ∅))
54elmpocl 7632 . . 3 (𝑋 ∈ (𝐹 oppFunc 𝐺) → (𝐹 ∈ V ∧ 𝐺 ∈ V))
63, 5syl 17 . 2 (𝜑 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
7 oppfvalg 49708 . . . . . 6 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 oppFunc 𝐺) = if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
86, 7syl 17 . . . . 5 (𝜑 → (𝐹 oppFunc 𝐺) = if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
93, 8eleqtrd 2863 . . . 4 (𝜑𝑋 ∈ if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
109ne0d 4292 . . 3 (𝜑 → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅)
11 iffalse 4486 . . . 4 (¬ (Rel 𝐺 ∧ Rel dom 𝐺) → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) = ∅)
1211necon1ai 2983 . . 3 (if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅ → (Rel 𝐺 ∧ Rel dom 𝐺))
1310, 12syl 17 . 2 (𝜑 → (Rel 𝐺 ∧ Rel dom 𝐺))
146, 13jca 519 1 (𝜑 → ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Rel 𝐺 ∧ Rel dom 𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  wne 2956  Vcvv 3453  c0 4283  ifcif 4477  cop 4585  dom cdm 5643  Rel wrel 5648  (class class class)co 7391  tpos ctpos 8199   oppFunc coppf 49704
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-res 5655  df-iota 6472  df-fun 6518  df-fv 6524  df-ov 7394  df-oprab 7395  df-mpo 7396  df-tpos 8200  df-oppf 49705
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator