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 50066

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 6895	. . 3 ⊢ (1^st ‘𝐹) ∈ V
2		fvex 6895	. . . 4 ⊢ (2^nd ‘𝐹) ∈ V
3	2	tposex 8262	. . 3 ⊢ tpos (2^nd ‘𝐹) ∈ V
4		oppfvalg 50060	. . 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 7420	. . 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 50062	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (V × V))
11		1st2nd2 8029	. . . . . . 7 ⊢ (𝐹 ∈ (V × V) → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
12	10, 11	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
13	7, 8, 9, 12	oppf1st2nd 50065	. . . . 5 ⊢ (𝜑 → (𝐺 ∈ (V × V) ∧ ((1^st ‘𝐺) = (1^st ‘𝐹) ∧ (2^nd ‘𝐺) = tpos (2^nd ‘𝐹))))
14		eqopi 8026	. . . . 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 6886	. . 3 ⊢ (𝜑 → ( oppFunc ‘𝐺) = ( oppFunc ‘⟨(1^st ‘𝐹), tpos (2^nd ‘𝐹)⟩))
17	6, 16	eqtr4id 2816	. 2 ⊢ (𝜑 → ((1^st ‘𝐹) oppFunc tpos (2^nd ‘𝐹)) = ( oppFunc ‘𝐺))
18	7, 8, 9, 12	oppfrcl3 50064	. . . . 5 ⊢ (𝜑 → (Rel (2^nd ‘𝐹) ∧ Rel dom (2^nd ‘𝐹)))
19		tpostpos2 8249	. . . . 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 4843	. . 3 ⊢ (𝜑 → ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩ = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
22		0nelrel0 5719	. . . . . . 7 ⊢ (Rel dom (2^nd ‘𝐹) → ¬ ∅ ∈ dom (2^nd ‘𝐹))
23	18, 22	simpl2im 513	. . . . . 6 ⊢ (𝜑 → ¬ ∅ ∈ dom (2^nd ‘𝐹))
24		reldmtpos 8236	. . . . . 6 ⊢ (Rel dom tpos (2^nd ‘𝐹) ↔ ¬ ∅ ∈ dom (2^nd ‘𝐹))
25	23, 24	sylibr 237	. . . . 5 ⊢ (𝜑 → Rel dom tpos (2^nd ‘𝐹))
26		reltpos 8233	. . . . 5 ⊢ Rel tpos (2^nd ‘𝐹)
27	25, 26	jctil 529	. . . 4 ⊢ (𝜑 → (Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)))
28	27	iftrued 4493	. . 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 2807	. 2 ⊢ (𝜑 → if((Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)), ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩, ∅) = 𝐹)
30	5, 17, 29	3eqtr3a 2821	1 ⊢ (𝜑 → ( oppFunc ‘𝐺) = 𝐹)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∅c0 4282 ifcif 4485 ⟨cop 4593 × cxp 5657 dom cdm 5659 Rel wrel 5664 ‘cfv 6537 (class class class)co 7417 1^st c1st 7988 2^nd c2nd 7989 tpos ctpos 8227 oppFunc coppf 50056

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-tpos 8228 df-oppf 50057

This theorem is used by: oppff1 50082 oppff1o 50083 natoppfb 50165 cmddu 50602

W3C validator