Theorem 1idpru 7653

Description: Lemma for 1idpr 7654. (Contributed by Jim Kingdon, 13-Dec-2019.)

Assertion

Ref	Expression
1idpru	⊢ (𝐴 ∈ P → (2nd ‘(𝐴 ·P 1P)) = (2nd ‘𝐴))

Proof of Theorem 1idpru

Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑓 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssid 3200	. . . . . 6 ⊢ (2nd ‘1P) ⊆ (2nd ‘1P)
2		rexss 3247	. . . . . 6 ⊢ ((2nd ‘1P) ⊆ (2nd ‘1P) → (∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ) ↔ ∃ℎ ∈ (2nd ‘1P)(ℎ ∈ (2nd ‘1P) ∧ 𝑥 = (𝑓 ·Q ℎ))))
3	1, 2	ax-mp 5	. . . . 5 ⊢ (∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ) ↔ ∃ℎ ∈ (2nd ‘1P)(ℎ ∈ (2nd ‘1P) ∧ 𝑥 = (𝑓 ·Q ℎ)))
4		1pr 7616	. . . . . . . . . . 11 ⊢ 1P ∈ P
5		prop 7537	. . . . . . . . . . . 12 ⊢ (1P ∈ P → ⟨(1st ‘1P), (2nd ‘1P)⟩ ∈ P)
6		elprnqu 7544	. . . . . . . . . . . 12 ⊢ ((⟨(1st ‘1P), (2nd ‘1P)⟩ ∈ P ∧ ℎ ∈ (2nd ‘1P)) → ℎ ∈ Q)
7	5, 6	sylan 283	. . . . . . . . . . 11 ⊢ ((1P ∈ P ∧ ℎ ∈ (2nd ‘1P)) → ℎ ∈ Q)
8	4, 7	mpan 424	. . . . . . . . . 10 ⊢ (ℎ ∈ (2nd ‘1P) → ℎ ∈ Q)
9		prop 7537	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
10		elprnqu 7544	. . . . . . . . . . . 12 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → 𝑓 ∈ Q)
11	9, 10	sylan 283	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → 𝑓 ∈ Q)
12		breq2 4034	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑓 ·Q ℎ) → (𝑓 <Q 𝑥 ↔ 𝑓 <Q (𝑓 ·Q ℎ)))
13	12	3ad2ant3 1022	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ Q ∧ ℎ ∈ Q ∧ 𝑥 = (𝑓 ·Q ℎ)) → (𝑓 <Q 𝑥 ↔ 𝑓 <Q (𝑓 ·Q ℎ)))
14		1pru 7618	. . . . . . . . . . . . . . 15 ⊢ (2nd ‘1P) = {ℎ ∣ 1Q <Q ℎ}
15	14	abeq2i 2304	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ (2nd ‘1P) ↔ 1Q <Q ℎ)
16		1nq 7428	. . . . . . . . . . . . . . . . 17 ⊢ 1Q ∈ Q
17		ltmnqg 7463	. . . . . . . . . . . . . . . . 17 ⊢ ((1Q ∈ Q ∧ ℎ ∈ Q ∧ 𝑓 ∈ Q) → (1Q <Q ℎ ↔ (𝑓 ·Q 1Q) <Q (𝑓 ·Q ℎ)))
18	16, 17	mp3an1 1335	. . . . . . . . . . . . . . . 16 ⊢ ((ℎ ∈ Q ∧ 𝑓 ∈ Q) → (1Q <Q ℎ ↔ (𝑓 ·Q 1Q) <Q (𝑓 ·Q ℎ)))
19	18	ancoms 268	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ Q ∧ ℎ ∈ Q) → (1Q <Q ℎ ↔ (𝑓 ·Q 1Q) <Q (𝑓 ·Q ℎ)))
20		mulidnq 7451	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 ∈ Q → (𝑓 ·Q 1Q) = 𝑓)
21	20	breq1d 4040	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → ((𝑓 ·Q 1Q) <Q (𝑓 ·Q ℎ) ↔ 𝑓 <Q (𝑓 ·Q ℎ)))
22	21	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ Q ∧ ℎ ∈ Q) → ((𝑓 ·Q 1Q) <Q (𝑓 ·Q ℎ) ↔ 𝑓 <Q (𝑓 ·Q ℎ)))
23	19, 22	bitrd 188	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ Q ∧ ℎ ∈ Q) → (1Q <Q ℎ ↔ 𝑓 <Q (𝑓 ·Q ℎ)))
24	15, 23	bitr2id 193	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ Q ∧ ℎ ∈ Q) → (𝑓 <Q (𝑓 ·Q ℎ) ↔ ℎ ∈ (2nd ‘1P)))
25	24	3adant3 1019	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ Q ∧ ℎ ∈ Q ∧ 𝑥 = (𝑓 ·Q ℎ)) → (𝑓 <Q (𝑓 ·Q ℎ) ↔ ℎ ∈ (2nd ‘1P)))
26	13, 25	bitrd 188	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ Q ∧ ℎ ∈ Q ∧ 𝑥 = (𝑓 ·Q ℎ)) → (𝑓 <Q 𝑥 ↔ ℎ ∈ (2nd ‘1P)))
27	11, 26	syl3an1 1282	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) ∧ ℎ ∈ Q ∧ 𝑥 = (𝑓 ·Q ℎ)) → (𝑓 <Q 𝑥 ↔ ℎ ∈ (2nd ‘1P)))
28	8, 27	syl3an2 1283	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) ∧ ℎ ∈ (2nd ‘1P) ∧ 𝑥 = (𝑓 ·Q ℎ)) → (𝑓 <Q 𝑥 ↔ ℎ ∈ (2nd ‘1P)))
29	28	3expia 1207	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) ∧ ℎ ∈ (2nd ‘1P)) → (𝑥 = (𝑓 ·Q ℎ) → (𝑓 <Q 𝑥 ↔ ℎ ∈ (2nd ‘1P))))
30	29	pm5.32rd 451	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) ∧ ℎ ∈ (2nd ‘1P)) → ((𝑓 <Q 𝑥 ∧ 𝑥 = (𝑓 ·Q ℎ)) ↔ (ℎ ∈ (2nd ‘1P) ∧ 𝑥 = (𝑓 ·Q ℎ))))
31	30	rexbidva 2491	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → (∃ℎ ∈ (2nd ‘1P)(𝑓 <Q 𝑥 ∧ 𝑥 = (𝑓 ·Q ℎ)) ↔ ∃ℎ ∈ (2nd ‘1P)(ℎ ∈ (2nd ‘1P) ∧ 𝑥 = (𝑓 ·Q ℎ))))
32		r19.42v 2651	. . . . . 6 ⊢ (∃ℎ ∈ (2nd ‘1P)(𝑓 <Q 𝑥 ∧ 𝑥 = (𝑓 ·Q ℎ)) ↔ (𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)))
33	31, 32	bitr3di 195	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → (∃ℎ ∈ (2nd ‘1P)(ℎ ∈ (2nd ‘1P) ∧ 𝑥 = (𝑓 ·Q ℎ)) ↔ (𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))))
34	3, 33	bitrid 192	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → (∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ) ↔ (𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))))
35	34	rexbidva 2491	. . 3 ⊢ (𝐴 ∈ P → (∃𝑓 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ) ↔ ∃𝑓 ∈ (2nd ‘𝐴)(𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))))
36		df-imp 7531	. . . . 5 ⊢ ·P = (𝑦 ∈ P, 𝑧 ∈ P ↦ ⟨{𝑤 ∈ Q ∣ ∃𝑢 ∈ Q ∃𝑣 ∈ Q (𝑢 ∈ (1st ‘𝑦) ∧ 𝑣 ∈ (1st ‘𝑧) ∧ 𝑤 = (𝑢 ·Q 𝑣))}, {𝑤 ∈ Q ∣ ∃𝑢 ∈ Q ∃𝑣 ∈ Q (𝑢 ∈ (2nd ‘𝑦) ∧ 𝑣 ∈ (2nd ‘𝑧) ∧ 𝑤 = (𝑢 ·Q 𝑣))}⟩)
37		mulclnq 7438	. . . . 5 ⊢ ((𝑢 ∈ Q ∧ 𝑣 ∈ Q) → (𝑢 ·Q 𝑣) ∈ Q)
38	36, 37	genpelvu 7575	. . . 4 ⊢ ((𝐴 ∈ P ∧ 1P ∈ P) → (𝑥 ∈ (2nd ‘(𝐴 ·P 1P)) ↔ ∃𝑓 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)))
39	4, 38	mpan2 425	. . 3 ⊢ (𝐴 ∈ P → (𝑥 ∈ (2nd ‘(𝐴 ·P 1P)) ↔ ∃𝑓 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)))
40		prnminu 7551	. . . . . . 7 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑥 ∈ (2nd ‘𝐴)) → ∃𝑓 ∈ (2nd ‘𝐴)𝑓 <Q 𝑥)
41	9, 40	sylan 283	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑥 ∈ (2nd ‘𝐴)) → ∃𝑓 ∈ (2nd ‘𝐴)𝑓 <Q 𝑥)
42		ltrelnq 7427	. . . . . . . . . . . . . 14 ⊢ <Q ⊆ (Q × Q)
43	42	brel 4712	. . . . . . . . . . . . 13 ⊢ (𝑓 <Q 𝑥 → (𝑓 ∈ Q ∧ 𝑥 ∈ Q))
44	43	ancomd 267	. . . . . . . . . . . 12 ⊢ (𝑓 <Q 𝑥 → (𝑥 ∈ Q ∧ 𝑓 ∈ Q))
45		ltmnqg 7463	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q) → (𝑦 <Q 𝑧 ↔ (𝑤 ·Q 𝑦) <Q (𝑤 ·Q 𝑧)))
46	45	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ Q ∧ 𝑓 ∈ Q) ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q)) → (𝑦 <Q 𝑧 ↔ (𝑤 ·Q 𝑦) <Q (𝑤 ·Q 𝑧)))
47		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → 𝑓 ∈ Q)
48		simpl 109	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → 𝑥 ∈ Q)
49		recclnq 7454	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → (*Q‘𝑓) ∈ Q)
50	49	adantl 277	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (*Q‘𝑓) ∈ Q)
51		mulcomnqg 7445	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦))
52	51	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ Q ∧ 𝑓 ∈ Q) ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q)) → (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦))
53	46, 47, 48, 50, 52	caovord2d 6090	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑓 <Q 𝑥 ↔ (𝑓 ·Q (*Q‘𝑓)) <Q (𝑥 ·Q (*Q‘𝑓))))
54		recidnq 7455	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → (𝑓 ·Q (*Q‘𝑓)) = 1Q)
55	54	breq1d 4040	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ Q → ((𝑓 ·Q (*Q‘𝑓)) <Q (𝑥 ·Q (*Q‘𝑓)) ↔ 1Q <Q (𝑥 ·Q (*Q‘𝑓))))
56	55	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → ((𝑓 ·Q (*Q‘𝑓)) <Q (𝑥 ·Q (*Q‘𝑓)) ↔ 1Q <Q (𝑥 ·Q (*Q‘𝑓))))
57	53, 56	bitrd 188	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑓 <Q 𝑥 ↔ 1Q <Q (𝑥 ·Q (*Q‘𝑓))))
58	57	biimpd 144	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑓 <Q 𝑥 → 1Q <Q (𝑥 ·Q (*Q‘𝑓))))
59	44, 58	mpcom 36	. . . . . . . . . . 11 ⊢ (𝑓 <Q 𝑥 → 1Q <Q (𝑥 ·Q (*Q‘𝑓)))
60		mulclnq 7438	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Q ∧ (*Q‘𝑓) ∈ Q) → (𝑥 ·Q (*Q‘𝑓)) ∈ Q)
61	49, 60	sylan2 286	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·Q (*Q‘𝑓)) ∈ Q)
62		breq2 4034	. . . . . . . . . . . . 13 ⊢ (ℎ = (𝑥 ·Q (*Q‘𝑓)) → (1Q <Q ℎ ↔ 1Q <Q (𝑥 ·Q (*Q‘𝑓))))
63	62, 14	elab2g 2908	. . . . . . . . . . . 12 ⊢ ((𝑥 ·Q (*Q‘𝑓)) ∈ Q → ((𝑥 ·Q (*Q‘𝑓)) ∈ (2nd ‘1P) ↔ 1Q <Q (𝑥 ·Q (*Q‘𝑓))))
64	44, 61, 63	3syl 17	. . . . . . . . . . 11 ⊢ (𝑓 <Q 𝑥 → ((𝑥 ·Q (*Q‘𝑓)) ∈ (2nd ‘1P) ↔ 1Q <Q (𝑥 ·Q (*Q‘𝑓))))
65	59, 64	mpbird 167	. . . . . . . . . 10 ⊢ (𝑓 <Q 𝑥 → (𝑥 ·Q (*Q‘𝑓)) ∈ (2nd ‘1P))
66		mulassnqg 7446	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q) → ((𝑦 ·Q 𝑧) ·Q 𝑤) = (𝑦 ·Q (𝑧 ·Q 𝑤)))
67	66	adantl 277	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ Q ∧ 𝑓 ∈ Q) ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q)) → ((𝑦 ·Q 𝑧) ·Q 𝑤) = (𝑦 ·Q (𝑧 ·Q 𝑤)))
68	47, 48, 50, 52, 67	caov12d 6102	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑓 ·Q (𝑥 ·Q (*Q‘𝑓))) = (𝑥 ·Q (𝑓 ·Q (*Q‘𝑓))))
69	54	oveq2d 5935	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ Q → (𝑥 ·Q (𝑓 ·Q (*Q‘𝑓))) = (𝑥 ·Q 1Q))
70	69	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·Q (𝑓 ·Q (*Q‘𝑓))) = (𝑥 ·Q 1Q))
71		mulidnq 7451	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ Q → (𝑥 ·Q 1Q) = 𝑥)
72	71	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·Q 1Q) = 𝑥)
73	68, 70, 72	3eqtrrd 2231	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → 𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q‘𝑓))))
74	44, 73	syl 14	. . . . . . . . . 10 ⊢ (𝑓 <Q 𝑥 → 𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q‘𝑓))))
75		oveq2 5927	. . . . . . . . . . . 12 ⊢ (ℎ = (𝑥 ·Q (*Q‘𝑓)) → (𝑓 ·Q ℎ) = (𝑓 ·Q (𝑥 ·Q (*Q‘𝑓))))
76	75	eqeq2d 2205	. . . . . . . . . . 11 ⊢ (ℎ = (𝑥 ·Q (*Q‘𝑓)) → (𝑥 = (𝑓 ·Q ℎ) ↔ 𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q‘𝑓)))))
77	76	rspcev 2865	. . . . . . . . . 10 ⊢ (((𝑥 ·Q (*Q‘𝑓)) ∈ (2nd ‘1P) ∧ 𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q‘𝑓)))) → ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))
78	65, 74, 77	syl2anc 411	. . . . . . . . 9 ⊢ (𝑓 <Q 𝑥 → ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))
79	78	a1i 9	. . . . . . . 8 ⊢ (𝑓 ∈ (2nd ‘𝐴) → (𝑓 <Q 𝑥 → ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)))
80	79	ancld 325	. . . . . . 7 ⊢ (𝑓 ∈ (2nd ‘𝐴) → (𝑓 <Q 𝑥 → (𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))))
81	80	reximia 2589	. . . . . 6 ⊢ (∃𝑓 ∈ (2nd ‘𝐴)𝑓 <Q 𝑥 → ∃𝑓 ∈ (2nd ‘𝐴)(𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)))
82	41, 81	syl 14	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝑥 ∈ (2nd ‘𝐴)) → ∃𝑓 ∈ (2nd ‘𝐴)(𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)))
83	82	ex 115	. . . 4 ⊢ (𝐴 ∈ P → (𝑥 ∈ (2nd ‘𝐴) → ∃𝑓 ∈ (2nd ‘𝐴)(𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))))
84		prcunqu 7547	. . . . . . 7 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → (𝑓 <Q 𝑥 → 𝑥 ∈ (2nd ‘𝐴)))
85	9, 84	sylan 283	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → (𝑓 <Q 𝑥 → 𝑥 ∈ (2nd ‘𝐴)))
86	85	adantrd 279	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (2nd ‘𝐴)) → ((𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)) → 𝑥 ∈ (2nd ‘𝐴)))
87	86	rexlimdva 2611	. . . 4 ⊢ (𝐴 ∈ P → (∃𝑓 ∈ (2nd ‘𝐴)(𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ)) → 𝑥 ∈ (2nd ‘𝐴)))
88	83, 87	impbid 129	. . 3 ⊢ (𝐴 ∈ P → (𝑥 ∈ (2nd ‘𝐴) ↔ ∃𝑓 ∈ (2nd ‘𝐴)(𝑓 <Q 𝑥 ∧ ∃ℎ ∈ (2nd ‘1P)𝑥 = (𝑓 ·Q ℎ))))
89	35, 39, 88	3bitr4d 220	. 2 ⊢ (𝐴 ∈ P → (𝑥 ∈ (2nd ‘(𝐴 ·P 1P)) ↔ 𝑥 ∈ (2nd ‘𝐴)))
90	89	eqrdv 2191	1 ⊢ (𝐴 ∈ P → (2nd ‘(𝐴 ·P 1P)) = (2nd ‘𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 980   = wceq 1364   ∈ wcel 2164  ∃wrex 2473   ⊆ wss 3154  ⟨cop 3622   class class class wbr 4030  ‘cfv 5255  (class class class)co 5919  1^st c1st 6193  2^nd c2nd 6194  Qcnq 7342  1_Qc1q 7343   ·_Q cmq 7345  *_Qcrq 7346   <_Q cltq 7347  Pcnp 7353  1_Pc1p 7354   ·_P cmp 7356

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-eprel 4321  df-id 4325  df-po 4328  df-iso 4329  df-iord 4398  df-on 4400  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-irdg 6425  df-1o 6471  df-oadd 6475  df-omul 6476  df-er 6589  df-ec 6591  df-qs 6595  df-ni 7366  df-pli 7367  df-mi 7368  df-lti 7369  df-plpq 7406  df-mpq 7407  df-enq 7409  df-nqqs 7410  df-plqqs 7411  df-mqqs 7412  df-1nqqs 7413  df-rq 7414  df-ltnqqs 7415  df-inp 7528  df-i1p 7529  df-imp 7531

This theorem is referenced by:  1idpr  7654