2oppf - Mathbox for Zhi Wang

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

Theorem 2oppf 50341

Description: The double opposite functor is the original functor. Remark 3.42 of [Adamek] p. 39. (Contributed by Zhi Wang, 14-Nov-2025.)

**Hypotheses**
Ref	Expression
oppfrcl.1	⊢ (𝜑 → 𝐺 ∈ 𝑅)
oppfrcl.2	⊢ Rel 𝑅
oppfrcl.3	⊢ 𝐺 = ( oppFunc ‘𝐹)

**Assertion**
Ref	Expression
2oppf	⊢ (𝜑 → ( oppFunc ‘𝐺) = 𝐹)

**Proof of Theorem 2oppf**
Step	Hyp	Ref	Expression
1		fvex 6898	. . 3 ⊢ (1^st ‘𝐹) ∈ V
2		fvex 6898	. . . 4 ⊢ (2^nd ‘𝐹) ∈ V
3	2	tposex 8280	. . 3 ⊢ tpos (2^nd ‘𝐹) ∈ V
4		oppfvalg 50335	. . 3 ⊢ (((1^st ‘𝐹) ∈ V ∧ tpos (2^nd ‘𝐹) ∈ V) → ((1^st ‘𝐹) oppFunc tpos (2^nd ‘𝐹)) = if((Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)), ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩, ∅))
5	1, 3, 4	mp2an 705	. 2 ⊢ ((1^st ‘𝐹) oppFunc tpos (2^nd ‘𝐹)) = if((Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)), ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩, ∅)
6		df-ov 7423	. . 3 ⊢ ((1^st ‘𝐹) oppFunc tpos (2^nd ‘𝐹)) = ( oppFunc ‘⟨(1^st ‘𝐹), tpos (2^nd ‘𝐹)⟩)
7		oppfrcl.1	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ 𝑅)
8		oppfrcl.2	. . . . . 6 ⊢ Rel 𝑅
9		oppfrcl.3	. . . . . 6 ⊢ 𝐺 = ( oppFunc ‘𝐹)
10	7, 8, 9	oppfrcl 50337	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (V × V))
11		1st2nd2 8040	. . . . . . 7 ⊢ (𝐹 ∈ (V × V) → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
12	10, 11	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
13	7, 8, 9, 12	oppf1st2nd 50340	. . . . 5 ⊢ (𝜑 → (𝐺 ∈ (V × V) ∧ ((1^st ‘𝐺) = (1^st ‘𝐹) ∧ (2^nd ‘𝐺) = tpos (2^nd ‘𝐹))))
14		eqopi 8037	. . . . 5 ⊢ ((𝐺 ∈ (V × V) ∧ ((1^st ‘𝐺) = (1^st ‘𝐹) ∧ (2^nd ‘𝐺) = tpos (2^nd ‘𝐹))) → 𝐺 = ⟨(1^st ‘𝐹), tpos (2^nd ‘𝐹)⟩)
15	13, 14	syl 18	. . . 4 ⊢ (𝜑 → 𝐺 = ⟨(1^st ‘𝐹), tpos (2^nd ‘𝐹)⟩)
16	15	fveq2d 6889	. . 3 ⊢ (𝜑 → ( oppFunc ‘𝐺) = ( oppFunc ‘⟨(1^st ‘𝐹), tpos (2^nd ‘𝐹)⟩))
17	6, 16	eqtr4id 2814	. 2 ⊢ (𝜑 → ((1^st ‘𝐹) oppFunc tpos (2^nd ‘𝐹)) = ( oppFunc ‘𝐺))
18	7, 8, 9, 12	oppfrcl3 50339	. . . . 5 ⊢ (𝜑 → (Rel (2^nd ‘𝐹) ∧ Rel dom (2^nd ‘𝐹)))
19		tpostpos2 8267	. . . . 5 ⊢ ((Rel (2^nd ‘𝐹) ∧ Rel dom (2^nd ‘𝐹)) → tpos tpos (2^nd ‘𝐹) = (2^nd ‘𝐹))
20	18, 19	syl 18	. . . 4 ⊢ (𝜑 → tpos tpos (2^nd ‘𝐹) = (2^nd ‘𝐹))
21	20	opeq2d 4846	. . 3 ⊢ (𝜑 → ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩ = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
22		0nelrel0 5710	. . . . . . 7 ⊢ (Rel dom (2^nd ‘𝐹) → ¬ ∅ ∈ dom (2^nd ‘𝐹))
23	18, 22	simpl2im 513	. . . . . 6 ⊢ (𝜑 → ¬ ∅ ∈ dom (2^nd ‘𝐹))
24		reldmtpos 8254	. . . . . 6 ⊢ (Rel dom tpos (2^nd ‘𝐹) ↔ ¬ ∅ ∈ dom (2^nd ‘𝐹))
25	23, 24	sylibr 237	. . . . 5 ⊢ (𝜑 → Rel dom tpos (2^nd ‘𝐹))
26		reltpos 8251	. . . . 5 ⊢ Rel tpos (2^nd ‘𝐹)
27	25, 26	jctil 529	. . . 4 ⊢ (𝜑 → (Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)))
28	27	iftrued 4489	. . 3 ⊢ (𝜑 → if((Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)), ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩, ∅) = ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩)
29	21, 28, 12	3eqtr4d 2805	. 2 ⊢ (𝜑 → if((Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)), ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩, ∅) = 𝐹)
30	5, 17, 29	3eqtr3a 2819	1 ⊢ (𝜑 → ( oppFunc ‘𝐺) = 𝐹)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4278 ifcif 4481 ⟨cop 4834 × cxp 5648 dom cdm 5650 Rel wrel 5655 ‘cfv 6538 (class class class)co 7420 1^st c1st 7999 2^nd c2nd 8000 tpos ctpos 8245 oppFunc coppf 50331

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-tpos 8246 df-oppf 50332

This theorem is used by: oppff1 50357 oppff1o 50358 natoppfb 50446 cmddu 50944

W3C validator