Theorem eloppf2 50581

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.

Step	Hyp	Ref	Expression
1		eloppf2.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐾)
2		eloppf2.k	. . . 4 ⊢ (𝐹 oppFunc 𝐺) = 𝐾
3	1, 2	eleqtrrdi 2875	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝐹 oppFunc 𝐺))
4		df-oppf 50570	. . . 4 ⊢ oppFunc = (𝑓 ∈ V, 𝑔 ∈ V ↦ if((Rel 𝑔 ∧ Rel dom 𝑔), ⟨𝑓, tpos 𝑔⟩, ∅))
5	4	elmpocl 7694	. . 3 ⊢ (𝑋 ∈ (𝐹 oppFunc 𝐺) → (𝐹 ∈ V ∧ 𝐺 ∈ V))
6	3, 5	syl 18	. 2 ⊢ (𝜑 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
7		oppfvalg 50573	. . . . . 6 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 oppFunc 𝐺) = if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
8	6, 7	syl 18	. . . . 5 ⊢ (𝜑 → (𝐹 oppFunc 𝐺) = if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
9	3, 8	eleqtrd 2866	. . . 4 ⊢ (𝜑 → 𝑋 ∈ if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
10	9	ne0d 4291	. . 3 ⊢ (𝜑 → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅)
11		iffalse 4494	. . . 4 ⊢ (¬ (Rel 𝐺 ∧ Rel dom 𝐺) → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) = ∅)
12	11	necon1ai 2986	. . 3 ⊢ (if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅ → (Rel 𝐺 ∧ Rel dom 𝐺))
13	10, 12	syl 18	. 2 ⊢ (𝜑 → (Rel 𝐺 ∧ Rel dom 𝐺))
14	6, 13	jca 521	1 ⊢ (𝜑 → ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Rel 𝐺 ∧ Rel dom 𝐺)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454  ∅c0 4281  ifcif 4485  ⟨cop 4840  dom cdm 5658  Rel wrel 5663  (class class class)co 7451  tpos ctpos 8280   oppFunc coppf 50569

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-tpos 8281  df-oppf 50570

This theorem is used by: (None)