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 50453

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 6921	. . 3 ⊢ (1^st ‘𝐹) ∈ V
2		fvex 6921	. . . 4 ⊢ (2^nd ‘𝐹) ∈ V
3	2	tposex 8305	. . 3 ⊢ tpos (2^nd ‘𝐹) ∈ V
4		oppfvalg 50447	. . 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 7446	. . 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 50449	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (V × V))
11		1st2nd2 8064	. . . . . . 7 ⊢ (𝐹 ∈ (V × V) → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
12	10, 11	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
13	7, 8, 9, 12	oppf1st2nd 50452	. . . . 5 ⊢ (𝜑 → (𝐺 ∈ (V × V) ∧ ((1^st ‘𝐺) = (1^st ‘𝐹) ∧ (2^nd ‘𝐺) = tpos (2^nd ‘𝐹))))
14		eqopi 8061	. . . . 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 6912	. . 3 ⊢ (𝜑 → ( oppFunc ‘𝐺) = ( oppFunc ‘⟨(1^st ‘𝐹), tpos (2^nd ‘𝐹)⟩))
17	6, 16	eqtr4id 2817	. 2 ⊢ (𝜑 → ((1^st ‘𝐹) oppFunc tpos (2^nd ‘𝐹)) = ( oppFunc ‘𝐺))
18	7, 8, 9, 12	oppfrcl3 50451	. . . . 5 ⊢ (𝜑 → (Rel (2^nd ‘𝐹) ∧ Rel dom (2^nd ‘𝐹)))
19		tpostpos2 8292	. . . . 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 4850	. . 3 ⊢ (𝜑 → ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩ = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
22		0nelrel0 5715	. . . . . . 7 ⊢ (Rel dom (2^nd ‘𝐹) → ¬ ∅ ∈ dom (2^nd ‘𝐹))
23	18, 22	simpl2im 513	. . . . . 6 ⊢ (𝜑 → ¬ ∅ ∈ dom (2^nd ‘𝐹))
24		reldmtpos 8279	. . . . . 6 ⊢ (Rel dom tpos (2^nd ‘𝐹) ↔ ¬ ∅ ∈ dom (2^nd ‘𝐹))
25	23, 24	sylibr 237	. . . . 5 ⊢ (𝜑 → Rel dom tpos (2^nd ‘𝐹))
26		reltpos 8276	. . . . 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 2808	. 2 ⊢ (𝜑 → if((Rel tpos (2^nd ‘𝐹) ∧ Rel dom tpos (2^nd ‘𝐹)), ⟨(1^st ‘𝐹), tpos tpos (2^nd ‘𝐹)⟩, ∅) = 𝐹)
30	5, 17, 29	3eqtr3a 2822	1 ⊢ (𝜑 → ( oppFunc ‘𝐺) = 𝐹)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∅c0 4281 ifcif 4485 ⟨cop 4838 × cxp 5653 dom cdm 5655 Rel wrel 5660 ‘cfv 6558 (class class class)co 7443 1^st c1st 8023 2^nd c2nd 8024 tpos ctpos 8270 oppFunc coppf 50443

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 df-1st 8025 df-2nd 8026 df-tpos 8271 df-oppf 50444

This theorem is used by: oppff1 50469 oppff1o 50470 natoppfb 50558 cmddu 51056

W3C validator