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 49609
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 2847 . . 3 (𝜑𝑋 ∈ (𝐹 oppFunc 𝐺))
4 df-oppf 49598 . . . 4 oppFunc = (𝑓 ∈ V, 𝑔 ∈ V ↦ if((Rel 𝑔 ∧ Rel dom 𝑔), ⟨𝑓, tpos 𝑔⟩, ∅))
54elmpocl 7608 . . 3 (𝑋 ∈ (𝐹 oppFunc 𝐺) → (𝐹 ∈ V ∧ 𝐺 ∈ V))
63, 5syl 17 . 2 (𝜑 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
7 oppfvalg 49601 . . . . . 6 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 oppFunc 𝐺) = if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
86, 7syl 17 . . . . 5 (𝜑 → (𝐹 oppFunc 𝐺) = if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
93, 8eleqtrd 2838 . . . 4 (𝜑𝑋 ∈ if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
109ne0d 4282 . . 3 (𝜑 → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅)
11 iffalse 4475 . . . 4 (¬ (Rel 𝐺 ∧ Rel dom 𝐺) → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) = ∅)
1211necon1ai 2959 . . 3 (if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅ → (Rel 𝐺 ∧ Rel dom 𝐺))
1310, 12syl 17 . 2 (𝜑 → (Rel 𝐺 ∧ Rel dom 𝐺))
146, 13jca 511 1 (𝜑 → ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Rel 𝐺 ∧ Rel dom 𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wne 2932  Vcvv 3429  c0 4273  ifcif 4466  cop 4573  dom cdm 5631  Rel wrel 5636  (class class class)co 7367  tpos ctpos 8175   oppFunc coppf 49597
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-res 5643  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-tpos 8176  df-oppf 49598
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator