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 50184

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 6890	. . 3 ⊢ (1^st ‘𝐹) ∈ V
2		fvex 6890	. . . 4 ⊢ (2^nd ‘𝐹) ∈ V
3	2	tposex 8261	. . 3 ⊢ tpos (2^nd ‘𝐹) ∈ V
4		oppfvalg 50178	. . 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 7415	. . 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 50180	. . . . . . 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 50183	. . . . 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 6881	. . 3 ⊢ (𝜑 → ( oppFunc ‘𝐺) = ( oppFunc ‘⟨(1^st ‘𝐹), tpos (2^nd ‘𝐹)⟩))
17	6, 16	eqtr4id 2815	. 2 ⊢ (𝜑 → ((1^st ‘𝐹) oppFunc tpos (2^nd ‘𝐹)) = ( oppFunc ‘𝐺))
18	7, 8, 9, 12	oppfrcl3 50182	. . . . 5 ⊢ (𝜑 → (Rel (2^nd ‘𝐹) ∧ Rel dom (2^nd ‘𝐹)))
19		tpostpos2 8248	. . . . 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 4840	. . 3 ⊢ (𝜑 → ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩ = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
22		0nelrel0 5711	. . . . . . 7 ⊢ (Rel dom (2^nd ‘𝐹) → ¬ ∅ ∈ dom (2^nd ‘𝐹))
23	18, 22	simpl2im 513	. . . . . 6 ⊢ (𝜑 → ¬ ∅ ∈ dom (2^nd ‘𝐹))
24		reldmtpos 8235	. . . . . 6 ⊢ (Rel dom tpos (2^nd ‘𝐹) ↔ ¬ ∅ ∈ dom (2^nd ‘𝐹))
25	23, 24	sylibr 237	. . . . 5 ⊢ (𝜑 → Rel dom tpos (2^nd ‘𝐹))
26		reltpos 8232	. . . . 5 ⊢ Rel tpos (2^nd ‘𝐹)
27	25, 26	jctil 529	. . . 4 ⊢ (𝜑 → (Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)))
28	27	iftrued 4490	. . 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 2806	. 2 ⊢ (𝜑 → if((Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)), ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩, ∅) = 𝐹)
30	5, 17, 29	3eqtr3a 2820	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 3451 ∅c0 4279 ifcif 4482 ⟨cop 4590 × cxp 5649 dom cdm 5651 Rel wrel 5656 ‘cfv 6531 (class class class)co 7412 1^st c1st 7988 2^nd c2nd 7989 tpos ctpos 8226 oppFunc coppf 50174

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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 df-tpos 8227 df-oppf 50175

This theorem is used by: oppff1 50200 oppff1o 50201 natoppfb 50283 cmddu 50720

W3C validator