invpropdlem - Mathbox for Zhi Wang

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

Theorem invpropdlem 49199

Description: Lemma for invpropd 49200. (Contributed by Zhi Wang, 27-Oct-2025.)

**Hypotheses**
Ref	Expression
sectpropd.1	⊢ (𝜑 → (Hom_f ‘𝐶) = (Hom_f ‘𝐷))
sectpropd.2	⊢ (𝜑 → (comp_f‘𝐶) = (comp_f‘𝐷))

**Assertion**
Ref	Expression
invpropdlem	⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝑃 ∈ (Inv‘𝐷))

Proof of Theorem invpropdlem Dummy variables 𝑐 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝑃 ∈ (Inv‘𝐶))
2		eqid 2733	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2733	. . . . . 6 ⊢ (Inv‘𝐶) = (Inv‘𝐶)
4		df-inv 17663	. . . . . . . 8 ⊢ Inv = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ^◡(𝑦(Sect‘𝑐)𝑥))))
5	4	mptrcl 6947	. . . . . . 7 ⊢ (𝑃 ∈ (Inv‘𝐶) → 𝐶 ∈ Cat)
6	5	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝐶 ∈ Cat)
7		eqid 2733	. . . . . 6 ⊢ (Sect‘𝐶) = (Sect‘𝐶)
8	2, 3, 6, 7	invffval 17673	. . . . 5 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (Inv‘𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥))))
9		df-mpo 7360	. . . . 5 ⊢ (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥))) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥)))}
10	8, 9	eqtrdi 2784	. . . 4 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (Inv‘𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥)))})
11	1, 10	eleqtrd 2835	. . 3 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝑃 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥)))})
12		eloprab1st2nd 49029	. . 3 ⊢ (𝑃 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥)))} → 𝑃 = ⟨⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩, (2^nd ‘𝑃)⟩)
13	11, 12	syl 17	. 2 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝑃 = ⟨⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩, (2^nd ‘𝑃)⟩)
14		sectpropd.1	. . . . . . . . 9 ⊢ (𝜑 → (Hom_f ‘𝐶) = (Hom_f ‘𝐷))
15	14	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (Hom_f ‘𝐶) = (Hom_f ‘𝐷))
16		sectpropd.2	. . . . . . . . 9 ⊢ (𝜑 → (comp_f‘𝐶) = (comp_f‘𝐷))
17	16	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (comp_f‘𝐶) = (comp_f‘𝐷))
18	15, 17	sectpropd 49198	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (Sect‘𝐶) = (Sect‘𝐷))
19	18	oveqd 7372	. . . . . 6 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → ((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) = ((1^st ‘(1^st ‘𝑃))(Sect‘𝐷)(2^nd ‘(1^st ‘𝑃))))
20	18	oveqd 7372	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → ((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))) = ((2^nd ‘(1^st ‘𝑃))(Sect‘𝐷)(1^st ‘(1^st ‘𝑃))))
21	20	cnveqd 5821	. . . . . 6 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))) = ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐷)(1^st ‘(1^st ‘𝑃))))
22	19, 21	ineq12d 4170	. . . . 5 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐷)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐷)(1^st ‘(1^st ‘𝑃)))))
23		eleq1 2821	. . . . . . . . . 10 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → (𝑥 ∈ (Base‘𝐶) ↔ (1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶)))
24	23	anbi1d 631	. . . . . . . . 9 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → ((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ↔ ((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))))
25		oveq1 7362	. . . . . . . . . . 11 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → (𝑥(Sect‘𝐶)𝑦) = ((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦))
26		oveq2 7363	. . . . . . . . . . . 12 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → (𝑦(Sect‘𝐶)𝑥) = (𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))
27	26	cnveqd 5821	. . . . . . . . . . 11 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → ^◡(𝑦(Sect‘𝐶)𝑥) = ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))
28	25, 27	ineq12d 4170	. . . . . . . . . 10 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥)) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))))
29	28	eqeq2d 2744	. . . . . . . . 9 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → (𝑧 = ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥)) ↔ 𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))))
30	24, 29	anbi12d 632	. . . . . . . 8 ⊢ (𝑥 = (1^st ‘(1^st ‘𝑃)) → (((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥))) ↔ (((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))))))
31		eleq1 2821	. . . . . . . . . 10 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → (𝑦 ∈ (Base‘𝐶) ↔ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶)))
32	31	anbi2d 630	. . . . . . . . 9 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → (((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ↔ ((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶))))
33		oveq2 7363	. . . . . . . . . . 11 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → ((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦) = ((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))))
34		oveq1 7362	. . . . . . . . . . . 12 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → (𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))) = ((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))
35	34	cnveqd 5821	. . . . . . . . . . 11 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))) = ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))
36	33, 35	ineq12d 4170	. . . . . . . . . 10 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))))
37	36	eqeq2d 2744	. . . . . . . . 9 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → (𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))) ↔ 𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))))
38	32, 37	anbi12d 632	. . . . . . . 8 ⊢ (𝑦 = (2^nd ‘(1^st ‘𝑃)) → ((((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))) ↔ (((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶)) ∧ 𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))))))
39		eqeq1 2737	. . . . . . . . 9 ⊢ (𝑧 = (2^nd ‘𝑃) → (𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))) ↔ (2^nd ‘𝑃) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))))
40	39	anbi2d 630	. . . . . . . 8 ⊢ (𝑧 = (2^nd ‘𝑃) → ((((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶)) ∧ 𝑧 = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))) ↔ (((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶)) ∧ (2^nd ‘𝑃) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))))))
41	30, 38, 40	eloprabi 8004	. . . . . . 7 ⊢ (𝑃 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) ∧ 𝑧 = ((𝑥(Sect‘𝐶)𝑦) ∩ ^◡(𝑦(Sect‘𝐶)𝑥)))} → (((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶)) ∧ (2^nd ‘𝑃) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))))
42	11, 41	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶) ∧ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶)) ∧ (2^nd ‘𝑃) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃))))))
43	42	simprd 495	. . . . 5 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (2^nd ‘𝑃) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐶)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐶)(1^st ‘(1^st ‘𝑃)))))
44		eqid 2733	. . . . . 6 ⊢ (Base‘𝐷) = (Base‘𝐷)
45		eqid 2733	. . . . . 6 ⊢ (Inv‘𝐷) = (Inv‘𝐷)
46	42	simplld 767	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐶))
47	15	homfeqbas 17610	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (Base‘𝐶) = (Base‘𝐷))
48	46, 47	eleqtrd 2835	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐷))
49	48	elfvexd 6867	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝐷 ∈ V)
50	15, 17, 6, 49	catpropd 17623	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (𝐶 ∈ Cat ↔ 𝐷 ∈ Cat))
51	6, 50	mpbid 232	. . . . . 6 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝐷 ∈ Cat)
52	42	simplrd 769	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐶))
53	52, 47	eleqtrd 2835	. . . . . 6 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐷))
54		eqid 2733	. . . . . 6 ⊢ (Sect‘𝐷) = (Sect‘𝐷)
55	44, 45, 51, 48, 53, 54	invfval 17674	. . . . 5 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → ((1^st ‘(1^st ‘𝑃))(Inv‘𝐷)(2^nd ‘(1^st ‘𝑃))) = (((1^st ‘(1^st ‘𝑃))(Sect‘𝐷)(2^nd ‘(1^st ‘𝑃))) ∩ ^◡((2^nd ‘(1^st ‘𝑃))(Sect‘𝐷)(1^st ‘(1^st ‘𝑃)))))
56	22, 43, 55	3eqtr4rd 2779	. . . 4 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → ((1^st ‘(1^st ‘𝑃))(Inv‘𝐷)(2^nd ‘(1^st ‘𝑃))) = (2^nd ‘𝑃))
57		invfn 49191	. . . . . 6 ⊢ (𝐷 ∈ Cat → (Inv‘𝐷) Fn ((Base‘𝐷) × (Base‘𝐷)))
58	51, 57	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (Inv‘𝐷) Fn ((Base‘𝐷) × (Base‘𝐷)))
59		fnbrovb 7406	. . . . 5 ⊢ (((Inv‘𝐷) Fn ((Base‘𝐷) × (Base‘𝐷)) ∧ ((1^st ‘(1^st ‘𝑃)) ∈ (Base‘𝐷) ∧ (2^nd ‘(1^st ‘𝑃)) ∈ (Base‘𝐷))) → (((1^st ‘(1^st ‘𝑃))(Inv‘𝐷)(2^nd ‘(1^st ‘𝑃))) = (2^nd ‘𝑃) ↔ ⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩(Inv‘𝐷)(2^nd ‘𝑃)))
60	58, 48, 53, 59	syl12anc 836	. . . 4 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → (((1^st ‘(1^st ‘𝑃))(Inv‘𝐷)(2^nd ‘(1^st ‘𝑃))) = (2^nd ‘𝑃) ↔ ⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩(Inv‘𝐷)(2^nd ‘𝑃)))
61	56, 60	mpbid 232	. . 3 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → ⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩(Inv‘𝐷)(2^nd ‘𝑃))
62		df-br 5096	. . 3 ⊢ (⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩(Inv‘𝐷)(2^nd ‘𝑃) ↔ ⟨⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩, (2^nd ‘𝑃)⟩ ∈ (Inv‘𝐷))
63	61, 62	sylib 218	. 2 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → ⟨⟨(1^st ‘(1^st ‘𝑃)), (2^nd ‘(1^st ‘𝑃))⟩, (2^nd ‘𝑃)⟩ ∈ (Inv‘𝐷))
64	13, 63	eqeltrd 2833	1 ⊢ ((𝜑 ∧ 𝑃 ∈ (Inv‘𝐶)) → 𝑃 ∈ (Inv‘𝐷))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3437 ∩ cin 3897 ⟨cop 4583 class class class wbr 5095 × cxp 5619 ^◡ccnv 5620 Fn wfn 6484 ‘cfv 6489 (class class class)co 7355 {coprab 7356 ∈ cmpo 7357 1^st c1st 7928 2^nd c2nd 7929 Basecbs 17127 Catccat 17578 Hom_f chomf 17580 comp_fccomf 17581 Sectcsect 17659 Invcinv 17660

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-1st 7930 df-2nd 7931 df-cat 17582 df-cid 17583 df-homf 17584 df-comf 17585 df-sect 17662 df-inv 17663

This theorem is referenced by: invpropd 49200

W3C validator