Theorem eloppf2 49969

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 2876	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝐹 oppFunc 𝐺))
4		df-oppf 49958	. . . 4 ⊢ oppFunc = (𝑓 ∈ V, 𝑔 ∈ V ↦ if((Rel 𝑔 ∧ Rel dom 𝑔), ⟨𝑓, tpos 𝑔⟩, ∅))
5	4	elmpocl 7661	. . 3 ⊢ (𝑋 ∈ (𝐹 oppFunc 𝐺) → (𝐹 ∈ V ∧ 𝐺 ∈ V))
6	3, 5	syl 18	. 2 ⊢ (𝜑 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
7		oppfvalg 49961	. . . . . 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 2867	. . . 4 ⊢ (𝜑 → 𝑋 ∈ if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
10	9	ne0d 4295	. . 3 ⊢ (𝜑 → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅)
11		iffalse 4498	. . . 4 ⊢ (¬ (Rel 𝐺 ∧ Rel dom 𝐺) → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) = ∅)
12	11	necon1ai 2987	. . 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 2146   ≠ wne 2960  Vcvv 3457  ∅c0 4286  ifcif 4489  ⟨cop 4597  dom cdm 5663  Rel wrel 5668  (class class class)co 7419  tpos ctpos 8227   oppFunc coppf 49957

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-res 5675  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-tpos 8228  df-oppf 49958

This theorem is used by: (None)