Theorem suplocexprlemmu 7981

Description: Lemma for suplocexpr 7988. The upper cut of the putative supremum is inhabited. (Contributed by Jim Kingdon, 7-Jan-2024.)

Hypotheses

Ref	Expression
suplocexpr.m	⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
suplocexpr.ub	⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
suplocexpr.loc	⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
suplocexpr.b	⊢ 𝐵 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}⟩

Assertion

Ref	Expression
suplocexprlemmu	⊢ (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ (2nd ‘𝐵))

Distinct variable groups:   𝐴,𝑠,𝑢,𝑤   𝑥,𝐴,𝑦,𝑠,𝑢   𝐵,𝑠   𝜑,𝑠,𝑢,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑧,𝑤)   𝐴(𝑧)   𝐵(𝑥,𝑦,𝑧,𝑤,𝑢)

Proof of Theorem suplocexprlemmu

Dummy variables 𝑗 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		suplocexpr.ub	. . . 4 ⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
2		prop 7738	. . . . . . 7 ⊢ (𝑥 ∈ P → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ P)
3		prmu 7741	. . . . . . 7 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ P → ∃𝑠 ∈ Q 𝑠 ∈ (2nd ‘𝑥))
4	2, 3	syl 14	. . . . . 6 ⊢ (𝑥 ∈ P → ∃𝑠 ∈ Q 𝑠 ∈ (2nd ‘𝑥))
5	4	ad2antrl 490	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) → ∃𝑠 ∈ Q 𝑠 ∈ (2nd ‘𝑥))
6		fo2nd 6330	. . . . . . . . . . . . 13 ⊢ 2nd :V–onto→V
7		fofun 5569	. . . . . . . . . . . . 13 ⊢ (2nd :V–onto→V → Fun 2nd )
8	6, 7	ax-mp 5	. . . . . . . . . . . 12 ⊢ Fun 2nd
9		fvelima 5706	. . . . . . . . . . . 12 ⊢ ((Fun 2nd ∧ 𝑡 ∈ (2nd “ 𝐴)) → ∃𝑢 ∈ 𝐴 (2nd ‘𝑢) = 𝑡)
10	8, 9	mpan 424	. . . . . . . . . . 11 ⊢ (𝑡 ∈ (2nd “ 𝐴) → ∃𝑢 ∈ 𝐴 (2nd ‘𝑢) = 𝑡)
11	10	adantl 277	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) → ∃𝑢 ∈ 𝐴 (2nd ‘𝑢) = 𝑡)
12		suplocexpr.m	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
13		suplocexpr.loc	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
14	12, 1, 13	suplocexprlemss 7978	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐴 ⊆ P)
15	14	ad5antr 496	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝐴 ⊆ P)
16		simprl 531	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝑢 ∈ 𝐴)
17	15, 16	sseldd 3229	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝑢 ∈ P)
18		simprl 531	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) → 𝑥 ∈ P)
19	18	ad4antr 494	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝑥 ∈ P)
20		breq1 4096	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑢 → (𝑦<P 𝑥 ↔ 𝑢<P 𝑥))
21		simprr 533	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) → ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
22	21	ad4antr 494	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
23	20, 22, 16	rspcdva 2916	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝑢<P 𝑥)
24		ltsopr 7859	. . . . . . . . . . . . . . . . 17 ⊢ <P Or P
25		so2nr 4424	. . . . . . . . . . . . . . . . 17 ⊢ ((<P Or P ∧ (𝑢 ∈ P ∧ 𝑥 ∈ P)) → ¬ (𝑢<P 𝑥 ∧ 𝑥<P 𝑢))
26	24, 25	mpan 424	. . . . . . . . . . . . . . . 16 ⊢ ((𝑢 ∈ P ∧ 𝑥 ∈ P) → ¬ (𝑢<P 𝑥 ∧ 𝑥<P 𝑢))
27	17, 19, 26	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → ¬ (𝑢<P 𝑥 ∧ 𝑥<P 𝑢))
28		imnan 697	. . . . . . . . . . . . . . 15 ⊢ ((𝑢<P 𝑥 → ¬ 𝑥<P 𝑢) ↔ ¬ (𝑢<P 𝑥 ∧ 𝑥<P 𝑢))
29	27, 28	sylibr 134	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → (𝑢<P 𝑥 → ¬ 𝑥<P 𝑢))
30	23, 29	mpd 13	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → ¬ 𝑥<P 𝑢)
31		aptiprlemu 7903	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∈ P ∧ 𝑥 ∈ P ∧ ¬ 𝑥<P 𝑢) → (2nd ‘𝑥) ⊆ (2nd ‘𝑢))
32	17, 19, 30, 31	syl3anc 1274	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → (2nd ‘𝑥) ⊆ (2nd ‘𝑢))
33		simpllr 536	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝑠 ∈ (2nd ‘𝑥))
34	32, 33	sseldd 3229	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝑠 ∈ (2nd ‘𝑢))
35		simprr 533	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → (2nd ‘𝑢) = 𝑡)
36	34, 35	eleqtrd 2310	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) ∧ (𝑢 ∈ 𝐴 ∧ (2nd ‘𝑢) = 𝑡)) → 𝑠 ∈ 𝑡)
37	11, 36	rexlimddv 2656	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) ∧ 𝑡 ∈ (2nd “ 𝐴)) → 𝑠 ∈ 𝑡)
38	37	ralrimiva 2606	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) → ∀𝑡 ∈ (2nd “ 𝐴)𝑠 ∈ 𝑡)
39		vex 2806	. . . . . . . . 9 ⊢ 𝑠 ∈ V
40	39	elint2 3940	. . . . . . . 8 ⊢ (𝑠 ∈ ∩ (2nd “ 𝐴) ↔ ∀𝑡 ∈ (2nd “ 𝐴)𝑠 ∈ 𝑡)
41	38, 40	sylibr 134	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) ∧ 𝑠 ∈ (2nd ‘𝑥)) → 𝑠 ∈ ∩ (2nd “ 𝐴))
42	41	ex 115	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) ∧ 𝑠 ∈ Q) → (𝑠 ∈ (2nd ‘𝑥) → 𝑠 ∈ ∩ (2nd “ 𝐴)))
43	42	reximdva 2635	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) → (∃𝑠 ∈ Q 𝑠 ∈ (2nd ‘𝑥) → ∃𝑠 ∈ Q 𝑠 ∈ ∩ (2nd “ 𝐴)))
44	5, 43	mpd 13	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ P ∧ ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)) → ∃𝑠 ∈ Q 𝑠 ∈ ∩ (2nd “ 𝐴))
45	1, 44	rexlimddv 2656	. . 3 ⊢ (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ ∩ (2nd “ 𝐴))
46		simprr 533	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → 𝑠 ∈ ∩ (2nd “ 𝐴))
47		simprl 531	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → 𝑠 ∈ Q)
48		1nq 7629	. . . . . . . . 9 ⊢ 1Q ∈ Q
49		addclnq 7638	. . . . . . . . 9 ⊢ ((𝑠 ∈ Q ∧ 1Q ∈ Q) → (𝑠 +Q 1Q) ∈ Q)
50	47, 48, 49	sylancl 413	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → (𝑠 +Q 1Q) ∈ Q)
51		ltaddnq 7670	. . . . . . . . 9 ⊢ ((𝑠 ∈ Q ∧ 1Q ∈ Q) → 𝑠 <Q (𝑠 +Q 1Q))
52	47, 48, 51	sylancl 413	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → 𝑠 <Q (𝑠 +Q 1Q))
53		breq2 4097	. . . . . . . . 9 ⊢ (𝑗 = (𝑠 +Q 1Q) → (𝑠 <Q 𝑗 ↔ 𝑠 <Q (𝑠 +Q 1Q)))
54	53	rspcev 2911	. . . . . . . 8 ⊢ (((𝑠 +Q 1Q) ∈ Q ∧ 𝑠 <Q (𝑠 +Q 1Q)) → ∃𝑗 ∈ Q 𝑠 <Q 𝑗)
55	50, 52, 54	syl2anc 411	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → ∃𝑗 ∈ Q 𝑠 <Q 𝑗)
56		breq1 4096	. . . . . . . . 9 ⊢ (𝑤 = 𝑠 → (𝑤 <Q 𝑗 ↔ 𝑠 <Q 𝑗))
57	56	rexbidv 2534	. . . . . . . 8 ⊢ (𝑤 = 𝑠 → (∃𝑗 ∈ Q 𝑤 <Q 𝑗 ↔ ∃𝑗 ∈ Q 𝑠 <Q 𝑗))
58	57	rspcev 2911	. . . . . . 7 ⊢ ((𝑠 ∈ ∩ (2nd “ 𝐴) ∧ ∃𝑗 ∈ Q 𝑠 <Q 𝑗) → ∃𝑤 ∈ ∩ (2nd “ 𝐴)∃𝑗 ∈ Q 𝑤 <Q 𝑗)
59	46, 55, 58	syl2anc 411	. . . . . 6 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → ∃𝑤 ∈ ∩ (2nd “ 𝐴)∃𝑗 ∈ Q 𝑤 <Q 𝑗)
60		rexcom 2698	. . . . . 6 ⊢ (∃𝑤 ∈ ∩ (2nd “ 𝐴)∃𝑗 ∈ Q 𝑤 <Q 𝑗 ↔ ∃𝑗 ∈ Q ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗)
61	59, 60	sylib 122	. . . . 5 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → ∃𝑗 ∈ Q ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗)
62		ssid 3248	. . . . . 6 ⊢ Q ⊆ Q
63		rexss 3295	. . . . . 6 ⊢ (Q ⊆ Q → (∃𝑗 ∈ Q ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗 ↔ ∃𝑗 ∈ Q (𝑗 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗)))
64	62, 63	ax-mp 5	. . . . 5 ⊢ (∃𝑗 ∈ Q ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗 ↔ ∃𝑗 ∈ Q (𝑗 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗))
65	61, 64	sylib 122	. . . 4 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → ∃𝑗 ∈ Q (𝑗 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗))
66		suplocexpr.b	. . . . . . . . . 10 ⊢ 𝐵 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}⟩
67	66	suplocexprlem2b 7977	. . . . . . . . 9 ⊢ (𝐴 ⊆ P → (2nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢})
68	14, 67	syl 14	. . . . . . . 8 ⊢ (𝜑 → (2nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢})
69	68	eleq2d 2301	. . . . . . 7 ⊢ (𝜑 → (𝑗 ∈ (2nd ‘𝐵) ↔ 𝑗 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}))
70		breq2 4097	. . . . . . . . 9 ⊢ (𝑢 = 𝑗 → (𝑤 <Q 𝑢 ↔ 𝑤 <Q 𝑗))
71	70	rexbidv 2534	. . . . . . . 8 ⊢ (𝑢 = 𝑗 → (∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢 ↔ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗))
72	71	elrab 2963	. . . . . . 7 ⊢ (𝑗 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢} ↔ (𝑗 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗))
73	69, 72	bitrdi 196	. . . . . 6 ⊢ (𝜑 → (𝑗 ∈ (2nd ‘𝐵) ↔ (𝑗 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗)))
74	73	rexbidv 2534	. . . . 5 ⊢ (𝜑 → (∃𝑗 ∈ Q 𝑗 ∈ (2nd ‘𝐵) ↔ ∃𝑗 ∈ Q (𝑗 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗)))
75	74	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → (∃𝑗 ∈ Q 𝑗 ∈ (2nd ‘𝐵) ↔ ∃𝑗 ∈ Q (𝑗 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑗)))
76	65, 75	mpbird 167	. . 3 ⊢ ((𝜑 ∧ (𝑠 ∈ Q ∧ 𝑠 ∈ ∩ (2nd “ 𝐴))) → ∃𝑗 ∈ Q 𝑗 ∈ (2nd ‘𝐵))
77	45, 76	rexlimddv 2656	. 2 ⊢ (𝜑 → ∃𝑗 ∈ Q 𝑗 ∈ (2nd ‘𝐵))
78		eleq1w 2292	. . 3 ⊢ (𝑗 = 𝑠 → (𝑗 ∈ (2nd ‘𝐵) ↔ 𝑠 ∈ (2nd ‘𝐵)))
79	78	cbvrexv 2769	. 2 ⊢ (∃𝑗 ∈ Q 𝑗 ∈ (2nd ‘𝐵) ↔ ∃𝑠 ∈ Q 𝑠 ∈ (2nd ‘𝐵))
80	77, 79	sylib 122	1 ⊢ (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ (2nd ‘𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716   = wceq 1398  ∃wex 1541   ∈ wcel 2202  ∀wral 2511  ∃wrex 2512  {crab 2515  Vcvv 2803   ⊆ wss 3201  ⟨cop 3676  ∪ cuni 3898  ∩ cint 3933   class class class wbr 4093   Or wor 4398   “ cima 4734  Fun wfun 5327  –onto→wfo 5331  ‘cfv 5333  (class class class)co 6028  1^st c1st 6310  2^nd c2nd 6311  Qcnq 7543  1_Qc1q 7544   +_Q cplq 7545   <_Q cltq 7548  Pcnp 7554  <_P cltp 7558

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-2o 6626  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616  df-enq0 7687  df-nq0 7688  df-0nq0 7689  df-plq0 7690  df-mq0 7691  df-inp 7729  df-iltp 7733

This theorem is referenced by:  suplocexprlemex  7985