1idprl - Intuitionistic Logic Explorer

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

Theorem 1idprl 7785

Description: Lemma for 1idpr 7787. (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 3244	. . . . . 6 ⊢ (1^st ‘1_P) ⊆ (1^st ‘1_P)
2		rexss 3291	. . . . . 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 7749	. . . . . . . . . . 11 ⊢ 1_P ∈ P
5		prop 7670	. . . . . . . . . . . 12 ⊢ (1_P ∈ P → ⟨(1^st ‘1_P), (2^nd ‘1_P)⟩ ∈ P)
6		elprnql 7676	. . . . . . . . . . . 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 424	. . . . . . . . . 10 ⊢ (𝑔 ∈ (1^st ‘1_P) → 𝑔 ∈ Q)
9		prop 7670	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
10		elprnql 7676	. . . . . . . . . . . 12 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
11	9, 10	sylan 283	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
12		breq1 4086	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑓 ·_Q 𝑔) → (𝑥 <_Q 𝑓 ↔ (𝑓 ·_Q 𝑔) <_Q 𝑓))
13	12	3ad2ant3 1044	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → (𝑥 <_Q 𝑓 ↔ (𝑓 ·_Q 𝑔) <_Q 𝑓))
14		1prl 7750	. . . . . . . . . . . . . . 15 ⊢ (1^st ‘1_P) = {𝑔 ∣ 𝑔 <_Q 1_Q}
15	14	abeq2i 2340	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ (1^st ‘1_P) ↔ 𝑔 <_Q 1_Q)
16		1nq 7561	. . . . . . . . . . . . . . . . 17 ⊢ 1_Q ∈ Q
17		ltmnqg 7596	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔 ∈ Q ∧ 1_Q ∈ Q ∧ 𝑓 ∈ Q) → (𝑔 <_Q 1_Q ↔ (𝑓 ·_Q 𝑔) <_Q (𝑓 ·_Q 1_Q)))
18	16, 17	mp3an2 1359	. . . . . . . . . . . . . . . 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 7584	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 ∈ Q → (𝑓 ·_Q 1_Q) = 𝑓)
21	20	breq2d 4095	. . . . . . . . . . . . . . . 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 1041	. . . . . . . . . . . 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 1304	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ Q ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → (𝑥 <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P)))
28	8, 27	syl3an2 1305	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔)) → (𝑥 <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P)))
29	28	3expia 1229	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ (1^st ‘1_P)) → (𝑥 = (𝑓 ·_Q 𝑔) → (𝑥 <_Q 𝑓 ↔ 𝑔 ∈ (1^st ‘1_P))))
30	29	pm5.32rd 451	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) ∧ 𝑔 ∈ (1^st ‘1_P)) → ((𝑥 <_Q 𝑓 ∧ 𝑥 = (𝑓 ·_Q 𝑔)) ↔ (𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔))))
31	30	rexbidva 2527	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → (∃𝑔 ∈ (1^st ‘1_P)(𝑥 <_Q 𝑓 ∧ 𝑥 = (𝑓 ·_Q 𝑔)) ↔ ∃𝑔 ∈ (1^st ‘1_P)(𝑔 ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q 𝑔))))
32		r19.42v 2688	. . . . . 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 2527	. . 3 ⊢ (𝐴 ∈ P → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔) ↔ ∃𝑓 ∈ (1^st ‘𝐴)(𝑥 <_Q 𝑓 ∧ ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))))
36		df-imp 7664	. . . . 5 ⊢ ·_P = (𝑦 ∈ P, 𝑧 ∈ P ↦ ⟨{𝑤 ∈ Q ∣ ∃𝑢 ∈ Q ∃𝑣 ∈ Q (𝑢 ∈ (1^st ‘𝑦) ∧ 𝑣 ∈ (1^st ‘𝑧) ∧ 𝑤 = (𝑢 ·_Q 𝑣))}, {𝑤 ∈ Q ∣ ∃𝑢 ∈ Q ∃𝑣 ∈ Q (𝑢 ∈ (2^nd ‘𝑦) ∧ 𝑣 ∈ (2^nd ‘𝑧) ∧ 𝑤 = (𝑢 ·_Q 𝑣))}⟩)
37		mulclnq 7571	. . . . 5 ⊢ ((𝑢 ∈ Q ∧ 𝑣 ∈ Q) → (𝑢 ·_Q 𝑣) ∈ Q)
38	36, 37	genpelvl 7707	. . . 4 ⊢ ((𝐴 ∈ P ∧ 1_P ∈ P) → (𝑥 ∈ (1^st ‘(𝐴 ·_P 1_P)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
39	4, 38	mpan2 425	. . 3 ⊢ (𝐴 ∈ P → (𝑥 ∈ (1^st ‘(𝐴 ·_P 1_P)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔)))
40		prnmaxl 7683	. . . . . . 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 7560	. . . . . . . . . . . . 13 ⊢ <_Q ⊆ (Q × Q)
43	42	brel 4771	. . . . . . . . . . . 12 ⊢ (𝑥 <_Q 𝑓 → (𝑥 ∈ Q ∧ 𝑓 ∈ Q))
44		ltmnqg 7596	. . . . . . . . . . . . . . . 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 7587	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → (*_Q‘𝑓) ∈ Q)
49	48	adantl 277	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (*_Q‘𝑓) ∈ Q)
50		mulcomnqg 7578	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦 ·_Q 𝑧) = (𝑧 ·_Q 𝑦))
51	50	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ Q ∧ 𝑓 ∈ Q) ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q)) → (𝑦 ·_Q 𝑧) = (𝑧 ·_Q 𝑦))
52	45, 46, 47, 49, 51	caovord2d 6181	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 <_Q 𝑓 ↔ (𝑥 ·_Q (_Q‘𝑓)) <_Q (𝑓 ·_Q (_Q‘𝑓))))
53		recidnq 7588	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 ∈ Q → (𝑓 ·_Q (*_Q‘𝑓)) = 1_Q)
54	53	breq2d 4095	. . . . . . . . . . . . . . 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 7571	. . . . . . . . . . . . . 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 4086	. . . . . . . . . . . . 13 ⊢ (𝑔 = (𝑥 ·_Q (_Q‘𝑓)) → (𝑔 <_Q 1_Q ↔ (𝑥 ·_Q (_Q‘𝑓)) <_Q 1_Q))
63	62, 14	elab2g 2950	. . . . . . . . . . . 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 7579	. . . . . . . . . . . . . 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 6193	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓))) = (𝑥 ·_Q (𝑓 ·_Q (_Q‘𝑓))))
69	53	oveq2d 6023	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ Q → (𝑥 ·_Q (𝑓 ·_Q (*_Q‘𝑓))) = (𝑥 ·_Q 1_Q))
70	69	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·_Q (𝑓 ·_Q (*_Q‘𝑓))) = (𝑥 ·_Q 1_Q))
71		mulidnq 7584	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ Q → (𝑥 ·_Q 1_Q) = 𝑥)
72	71	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 ·_Q 1_Q) = 𝑥)
73	68, 70, 72	3eqtrrd 2267	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (*_Q‘𝑓))))
74	43, 73	syl 14	. . . . . . . . . 10 ⊢ (𝑥 <_Q 𝑓 → 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (*_Q‘𝑓))))
75		oveq2 6015	. . . . . . . . . . . 12 ⊢ (𝑔 = (𝑥 ·_Q (_Q‘𝑓)) → (𝑓 ·_Q 𝑔) = (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓))))
76	75	eqeq2d 2241	. . . . . . . . . . 11 ⊢ (𝑔 = (𝑥 ·_Q (_Q‘𝑓)) → (𝑥 = (𝑓 ·_Q 𝑔) ↔ 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓)))))
77	76	rspcev 2907	. . . . . . . . . 10 ⊢ (((𝑥 ·_Q (_Q‘𝑓)) ∈ (1^st ‘1_P) ∧ 𝑥 = (𝑓 ·_Q (𝑥 ·_Q (_Q‘𝑓)))) → ∃𝑔 ∈ (1^st ‘1_P)𝑥 = (𝑓 ·_Q 𝑔))
78	65, 74, 77	syl2anc 411	. . . . . . . . 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 2625	. . . . . 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 7679	. . . . . . 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 2648	. . . 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 2227	1 ⊢ (𝐴 ∈ P → (1^st ‘(𝐴 ·_P 1_P)) = (1^st ‘𝐴))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ∃wrex 2509 ⊆ wss 3197 ⟨cop 3669 class class class wbr 4083 ‘cfv 5318 (class class class)co 6007 1^st c1st 6290 2^nd c2nd 6291 Qcnq 7475 1_Qc1q 7476 ·_Q cmq 7478 *_Qcrq 7479 <_Q cltq 7480 Pcnp 7486 1_Pc1p 7487 ·_P cmp 7489

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-eprel 4380 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-irdg 6522 df-1o 6568 df-oadd 6572 df-omul 6573 df-er 6688 df-ec 6690 df-qs 6694 df-ni 7499 df-pli 7500 df-mi 7501 df-lti 7502 df-plpq 7539 df-mpq 7540 df-enq 7542 df-nqqs 7543 df-plqqs 7544 df-mqqs 7545 df-1nqqs 7546 df-rq 7547 df-ltnqqs 7548 df-inp 7661 df-i1p 7662 df-imp 7664

This theorem is referenced by: 1idpr 7787

W3C validator