1idprl - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > 1idprl		GIF version

Theorem 1idprl 7958

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

**Assertion**
Ref	Expression
1idprl	⊢ (𝐴 ∈ P → (1^st ‘(𝐴 ·_P 1_P)) = (1^st ‘𝐴))

Proof of Theorem 1idprl Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssid 3268	. . . . . 6 ⊢ (1^st ‘1_P) ⊆ (1^st ‘1_P)
2		rexss 3315	. . . . . 6 ⊢ ((1^st ‘1_P) ⊆ (1^st ‘1_P) → (∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔) ↔ ∃𝑔 ∈ (1^st ‘1_P)(𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔))))
3	1, 2	ax-mp 5	. . . . 5 ⊢ (∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔) ↔ ∃𝑔 ∈ (1^st ‘1_P)(𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔)))
4		1pr 7922	. . . . . . . . . . 11 ⊢ 1_P ∈ P
5		prop 7843	. . . . . . . . . . . 12 ⊢ (1_P ∈ P → ⟨(1^st ‘1_P), (2^nd ‘1_P)⟩ ∈ P)
6		elprnql 7849	. . . . . . . . . . . 12 ⊢ ((⟨(1^st ‘1_P), (2^nd ‘1_P)⟩ ∈ P ∧ 𝑔 ∈ (1^st ‘1_P)) → 𝑔 ∈ Q)
7	5, 6	sylan 283	. . . . . . . . . . 11 ⊢ ((1_P ∈ P ∧ 𝑔 ∈ (1^st ‘1_P)) → 𝑔 ∈ Q)
8	4, 7	mpan 428	. . . . . . . . . 10 ⊢ (𝑔 ∈ (1^st ‘1_P) → 𝑔 ∈ Q)
9		prop 7843	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
10		elprnql 7849	. . . . . . . . . . . 12 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
11	9, 10	sylan 283	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
12		breq1 4133	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑓 ·_Q 𝑔) → (𝑥 <_Q 𝑓 ↔ (𝑓 ·_Q 𝑔) <_Q 𝑓))
13	12	3ad2ant3 1051	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → (𝑥 <_Q 𝑓 ↔ (𝑓 ·_Q 𝑔) <_Q 𝑓))
14		1prl 7923	. . . . . . . . . . . . . . 15 ⊢ (1^st ‘1_P) = {𝑔 ∣ 𝑔 <_Q 1_Q}
15	14	abeq2i 2349	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ (1^st ‘1_P) ↔ 𝑔 <_Q 1_Q)
16		1nq 7734	. . . . . . . . . . . . . . . . 17 ⊢ 1_Q ∈ Q
17		ltmnqg 7769	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔 ∈ Q ∧ 1_Q ∈ Q ∧ 𝑓 ∈ Q) → (𝑔 <_Q 1_Q ↔ (𝑓 ·_Q 𝑔) <_Q (𝑓 ·_Q 1_Q)))
18	16, 17	mp3an2 1366	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 ∈ Q ∧ 𝑓 ∈ Q) → (𝑔 <_Q 1_Q ↔ (𝑓 ·_Q 𝑔) <_Q (𝑓 ·_Q 1_Q)))
19	18	ancoms 268	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (𝑔 <_Q 1_Q ↔ (𝑓 ·_Q 𝑔) <_Q (𝑓 ·_Q 1_Q)))
20		mulidnq 7757	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 ∈ Q → (𝑓 ·_Q 1_Q) = 𝑓)
21	20	breq2d 4142	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → ((𝑓 ·_Q 𝑔) <_Q (𝑓 ·_Q 1_Q) ↔ (𝑓 ·_Q 𝑔) <_Q 𝑓))
22	21	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → ((𝑓 ·_Q 𝑔) <_Q (𝑓 ·_Q 1_Q) ↔ (𝑓 ·_Q 𝑔) <_Q 𝑓))
23	19, 22	bitrd 188	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (𝑔 <_Q 1_Q ↔ (𝑓 ·_Q 𝑔) <_Q 𝑓))
24	15, 23	bitr2id 193	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → ((𝑓 ·_Q 𝑔) <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P)))
25	24	3adant3 1048	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → ((𝑓 ·_Q 𝑔) <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P)))
26	13, 25	bitrd 188	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → (𝑥 <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P)))
27	11, 26	syl3an1 1311	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ Q ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → (𝑥 <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P)))
28	8, 27	syl3an2 1312	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → (𝑥 <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P)))
29	28	3expia 1236	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ (1^st ‘1_P)) → (𝑥 = (𝑓 ·_Q 𝑔) → (𝑥 <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P))))
30	29	pm5.32rd 455	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ (1^st ‘1_P)) → ((𝑥 <_Q 𝑓 ∧ 𝑥 = (𝑓 ·_Q 𝑔)) ↔ (𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔))))
31	30	rexbidva 2547	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → (∃𝑔 ∈ (1^st ‘1_P)(𝑥 <_Q 𝑓 ∧ 𝑥 = (𝑓 ·_Q 𝑔)) ↔ ∃𝑔 ∈ (1^st ‘1_P)(𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔))))
32		r19.42v 2708	. . . . . 6 ⊢ (∃𝑔 ∈ (1^st ‘1_P)(𝑥 <_Q 𝑓 ∧ 𝑥 = (𝑓 ·_Q 𝑔)) ↔ (𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
33	31, 32	bitr3di 195	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → (∃𝑔 ∈ (1^st ‘1_P)(𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔)) ↔ (𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))))
34	3, 33	bitrid 192	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → (∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔) ↔ (𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))))
35	34	rexbidva 2547	. . 3 ⊢ (𝐴 ∈ P → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔) ↔ ∃𝑓 ∈ (1^st ‘𝐴)(𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))))
36		df-imp 7837	. . . . 5 ⊢ ·_P = (𝑦 ∈ P, 𝑧 ∈ P ↦ ⟨{𝑤 ∈ Q ∣ ∃𝑢 ∈ Q ∃𝑣 ∈ Q (𝑢 ∈ (1^st ‘𝑦) ∧ 𝑣 ∈ (1^st ‘𝑧) ∧ 𝑤 = (𝑢 ·_Q 𝑣))}, {𝑤 ∈ Q ∣ ∃𝑢 ∈ Q ∃𝑣 ∈ Q (𝑢 ∈ (2^nd ‘𝑦) ∧ 𝑣 ∈ (2^nd ‘𝑧) ∧ 𝑤 = (𝑢 ·_Q 𝑣))}⟩)
37		mulclnq 7744	. . . . 5 ⊢ ((𝑢 ∈ Q ∧ 𝑣 ∈ Q) → (𝑢 ·_Q 𝑣) ∈ Q)
38	36, 37	genpelvl 7880	. . . 4 ⊢ ((𝐴 ∈ P ∧ 1_P ∈ P) → (𝑥 ∈ (1^st ‘(𝐴 ·_P 1_P)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
39	4, 38	mpan2 429	. . 3 ⊢ (𝐴 ∈ P → (𝑥 ∈ (1^st ‘(𝐴 ·_P 1_P)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
40		prnmaxl 7856	. . . . . . 7 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → ∃𝑓 ∈ (1^st ‘𝐴)𝑥 <_Q 𝑓)
41	9, 40	sylan 283	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → ∃𝑓 ∈ (1^st ‘𝐴)𝑥 <_Q 𝑓)
42		ltrelnq 7733	. . . . . . . . . . . . 13 ⊢ <_Q ⊆ (Q × Q)
43	42	brel 4827	. . . . . . . . . . . 12 ⊢ (𝑥 <_Q 𝑓 → (𝑥 ∈ Q ∧ 𝑓 ∈ Q))
44		ltmnqg 7769	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q) → (𝑦 <_Q 𝑧 ↔ (𝑤 ·_Q 𝑦) <_Q (𝑤 ·_Q 𝑧)))
45	44	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ Q ∧ 𝑓 ∈ Q) ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q)) → (𝑦 <_Q 𝑧 ↔ (𝑤 ·_Q 𝑦) <_Q (𝑤 ·_Q 𝑧)))
46		simpl 109	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → 𝑥 ∈ Q)
47		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → 𝑓 ∈ Q)
48		recclnq 7760	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → (*_Q‘𝑓) ∈ Q)
49	48	adantl 277	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (*_Q‘𝑓) ∈ Q)
50		mulcomnqg 7751	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦 ·_Q 𝑧) = (𝑧 ·_Q 𝑦))
51	50	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ Q ∧ 𝑓 ∈ Q) ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q)) → (𝑦 ·_Q 𝑧) = (𝑧 ·_Q 𝑦))
52	45, 46, 47, 49, 51	caovord2d 6259	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 <_Q 𝑓 ↔ (𝑥 ·_Q (_Q‘𝑓)) <_Q (𝑓 ·_Q (_Q‘𝑓))))
53		recidnq 7761	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → (𝑓 ·_Q (*_Q‘𝑓)) = 1_Q)
54	53	breq2d 4142	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ Q → ((𝑥 ·_Q (_Q‘𝑓)) <_Q (𝑓 ·_Q (_Q‘𝑓)) ↔ (𝑥 ·_Q (*_Q‘𝑓)) <_Q 1_Q))
55	54	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → ((𝑥 ·_Q (_Q‘𝑓)) <_Q (𝑓 ·_Q (_Q‘𝑓)) ↔ (𝑥 ·_Q (*_Q‘𝑓)) <_Q 1_Q))
56	52, 55	bitrd 188	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 <_Q 𝑓 ↔ (𝑥 ·_Q (*_Q‘𝑓)) <_Q 1_Q))
57	56	biimpd 144	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 <_Q 𝑓 → (𝑥 ·_Q (*_Q‘𝑓)) <_Q 1_Q))
58	43, 57	mpcom 36	. . . . . . . . . . 11 ⊢ (𝑥 <_Q 𝑓 → (𝑥 ·_Q (*_Q‘𝑓)) <_Q 1_Q)
59		mulclnq 7744	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Q ∧ (_Q‘𝑓) ∈ Q) → (𝑥 ·_Q (_Q‘𝑓)) ∈ Q)
60	48, 59	sylan2 286	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·_Q (*_Q‘𝑓)) ∈ Q)
61	43, 60	syl 14	. . . . . . . . . . . 12 ⊢ (𝑥 <_Q 𝑓 → (𝑥 ·_Q (*_Q‘𝑓)) ∈ Q)
62		breq1 4133	. . . . . . . . . . . . 13 ⊢ (𝑔 = (𝑥 ·_Q (_Q‘𝑓)) → (𝑔 <_Q 1_Q ↔ (𝑥 ·_Q (_Q‘𝑓)) <_Q 1_Q))
63	62, 14	elab2g 2973	. . . . . . . . . . . 12 ⊢ ((𝑥 ·_Q (_Q‘𝑓)) ∈ Q → ((𝑥 ·_Q (_Q‘𝑓)) ∈ (1^st ‘1_P) ↔ (𝑥 ·_Q (*_Q‘𝑓)) <_Q 1_Q))
64	61, 63	syl 14	. . . . . . . . . . 11 ⊢ (𝑥 <_Q 𝑓 → ((𝑥 ·_Q (_Q‘𝑓)) ∈ (1^st ‘1_P) ↔ (𝑥 ·_Q (_Q‘𝑓)) <_Q 1_Q))
65	58, 64	mpbird 167	. . . . . . . . . 10 ⊢ (𝑥 <_Q 𝑓 → (𝑥 ·_Q (*_Q‘𝑓)) ∈ (1^st ‘1_P))
66		mulassnqg 7752	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q) → ((𝑦 ·_Q 𝑧) ·_Q 𝑤) = (𝑦 ·_Q (𝑧 ·_Q 𝑤)))
67	66	adantl 277	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ Q ∧ 𝑓 ∈ Q) ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q ∧ 𝑤 ∈ Q)) → ((𝑦 ·_Q 𝑧) ·_Q 𝑤) = (𝑦 ·_Q (𝑧 ·_Q 𝑤)))
68	47, 46, 49, 51, 67	caov12d 6271	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓))) = (𝑥 ·_Q (𝑓 ·_Q (_Q‘𝑓))))
69	53	oveq2d 6101	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ Q → (𝑥 ·_Q (𝑓 ·_Q (*_Q‘𝑓))) = (𝑥 ·_Q 1_Q))
70	69	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·_Q (𝑓 ·_Q (*_Q‘𝑓))) = (𝑥 ·_Q 1_Q))
71		mulidnq 7757	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ Q → (𝑥 ·_Q 1_Q) = 𝑥)
72	71	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·_Q 1_Q) = 𝑥)
73	68, 70, 72	3eqtrrd 2276	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (*_Q‘𝑓))))
74	43, 73	syl 14	. . . . . . . . . 10 ⊢ (𝑥 <_Q 𝑓 → 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (*_Q‘𝑓))))
75		oveq2 6093	. . . . . . . . . . . 12 ⊢ (𝑔 = (𝑥 ·_Q (_Q‘𝑓)) → (𝑓 ·_Q 𝑔) = (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓))))
76	75	eqeq2d 2250	. . . . . . . . . . 11 ⊢ (𝑔 = (𝑥 ·_Q (_Q‘𝑓)) → (𝑥 = (𝑓 ·_Q 𝑔) ↔ 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓)))))
77	76	rspcev 2929	. . . . . . . . . 10 ⊢ (((𝑥 ·_Q (_Q‘𝑓)) ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓)))) → ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))
78	65, 74, 77	syl2anc 415	. . . . . . . . 9 ⊢ (𝑥 <_Q 𝑓 → ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))
79	78	a1i 9	. . . . . . . 8 ⊢ (𝑓 ∈ (1^st ‘𝐴) → (𝑥 <_Q 𝑓 → ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
80	79	ancld 325	. . . . . . 7 ⊢ (𝑓 ∈ (1^st ‘𝐴) → (𝑥 <_Q 𝑓 → (𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))))
81	80	reximia 2645	. . . . . 6 ⊢ (∃𝑓 ∈ (1^st ‘𝐴)𝑥 <_Q 𝑓 → ∃𝑓 ∈ (1^st ‘𝐴)(𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
82	41, 81	syl 14	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → ∃𝑓 ∈ (1^st ‘𝐴)(𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
83	82	ex 115	. . . 4 ⊢ (𝐴 ∈ P → (𝑥 ∈ (1^st ‘𝐴) → ∃𝑓 ∈ (1^st ‘𝐴)(𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))))
84		prcdnql 7852	. . . . . . 7 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → (𝑥 <_Q 𝑓 → 𝑥 ∈ (1^st ‘𝐴)))
85	9, 84	sylan 283	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → (𝑥 <_Q 𝑓 → 𝑥 ∈ (1^st ‘𝐴)))
86	85	adantrd 279	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → ((𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)) → 𝑥 ∈ (1^st ‘𝐴)))
87	86	rexlimdva 2668	. . . 4 ⊢ (𝐴 ∈ P → (∃𝑓 ∈ (1^st ‘𝐴)(𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)) → 𝑥 ∈ (1^st ‘𝐴)))
88	83, 87	impbid 129	. . 3 ⊢ (𝐴 ∈ P → (𝑥 ∈ (1^st ‘𝐴) ↔ ∃𝑓 ∈ (1^st ‘𝐴)(𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))))
89	35, 39, 88	3bitr4d 220	. 2 ⊢ (𝐴 ∈ P → (𝑥 ∈ (1^st ‘(𝐴 ·_P 1_P)) ↔ 𝑥 ∈ (1^st ‘𝐴)))
90	89	eqrdv 2236	1 ⊢ (𝐴 ∈ P → (1^st ‘(𝐴 ·_P 1_P)) = (1^st ‘𝐴))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 ⊆ wss 3220 ⟨cop 3712 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 1^st c1st 6372 2^nd c2nd 6373 Qcnq 7648 1_Qc1q 7649 ·_Q cmq 7651 *_Qcrq 7652 <_Q cltq 7653 Pcnp 7659 1_Pc1p 7660 ·_P cmp 7662

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-eprel 4434 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-1o 6687 df-oadd 6691 df-omul 6692 df-er 6807 df-ec 6809 df-qs 6813 df-ni 7672 df-pli 7673 df-mi 7674 df-lti 7675 df-plpq 7712 df-mpq 7713 df-enq 7715 df-nqqs 7716 df-plqqs 7717 df-mqqs 7718 df-1nqqs 7719 df-rq 7720 df-ltnqqs 7721 df-inp 7834 df-i1p 7835 df-imp 7837

This theorem is used by: 1idpr 7960

W3C validator