Theorem eloppf2 49952

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 2877	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝐹 oppFunc 𝐺))
4		df-oppf 49941	. . . 4 ⊢ oppFunc = (𝑓 ∈ V, 𝑔 ∈ V ↦ if((Rel 𝑔 ∧ Rel dom 𝑔), ⟨𝑓, tpos 𝑔⟩, ∅))
5	4	elmpocl 7664	. . 3 ⊢ (𝑋 ∈ (𝐹 oppFunc 𝐺) → (𝐹 ∈ V ∧ 𝐺 ∈ V))
6	3, 5	syl 18	. 2 ⊢ (𝜑 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
7		oppfvalg 49944	. . . . . 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 2868	. . . 4 ⊢ (𝜑 → 𝑋 ∈ if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅))
10	9	ne0d 4298	. . 3 ⊢ (𝜑 → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) ≠ ∅)
11		iffalse 4501	. . . 4 ⊢ (¬ (Rel 𝐺 ∧ Rel dom 𝐺) → if((Rel 𝐺 ∧ Rel dom 𝐺), ⟨𝐹, tpos 𝐺⟩, ∅) = ∅)
12	11	necon1ai 2988	. . 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 2961  Vcvv 3458  ∅c0 4289  ifcif 4492  ⟨cop 4600  dom cdm 5666  Rel wrel 5671  (class class class)co 7423  tpos ctpos 8230   oppFunc coppf 49940

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 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-res 5678  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-tpos 8231  df-oppf 49941

This theorem is used by: (None)