noinfbnd1lem1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > noinfbnd1lem1		Structured version Visualization version GIF version

Theorem noinfbnd1lem1 28080

Description: Lemma for noinfbnd1 28086. Establish a soft lower bound. (Contributed by Scott Fenton, 9-Aug-2024.)

**Hypothesis**
Ref	Expression
noinfbnd1.1	⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))

**Assertion**
Ref	Expression
noinfbnd1lem1	⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ (𝑈 ↾ dom 𝑇) <s 𝑇)

Distinct variable groups: 𝐵,𝑔,𝑢,𝑣,𝑥,𝑦 𝑣,𝑈 𝑔,𝑉 Allowed substitution hints: 𝑇(𝑥, 𝑦, 𝑣, 𝑢, 𝑔) 𝑈(𝑥, 𝑦, 𝑢, 𝑔) 𝑉(𝑥, 𝑦, 𝑣, 𝑢)

Proof of Theorem noinfbnd1lem1 Dummy variables ℎ 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		noinfbnd1.1	. . . 4 ⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
2	1	noinfno 28075	. . 3 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) → 𝑇 ∈ No)
3	2	3ad2ant2 1152	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑇 ∈ No)
4		simp2l 1218	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝐵 ⊆ No)
5		simp3 1156	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑈 ∈ 𝐵)
6	4, 5	sseldd 3909	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑈 ∈ No)
7		nodmon 28007	. . . 4 ⊢ (𝑇 ∈ No → dom 𝑇 ∈ On)
8	3, 7	syl 18	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → dom 𝑇 ∈ On)
9		noreson 28017	. . 3 ⊢ ((𝑈 ∈ No ∧ dom 𝑇 ∈ On) → (𝑈 ↾ dom 𝑇) ∈ No)
10	6, 8, 9	syl2anc 596	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (𝑈 ↾ dom 𝑇) ∈ No)
11		ssidd 3931	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → dom 𝑇 ⊆ dom 𝑇)
12		dmres 6002	. . . 4 ⊢ dom (𝑈 ↾ dom 𝑇) = (dom 𝑇 ∩ dom 𝑈)
13		inss1 4133	. . . 4 ⊢ (dom 𝑇 ∩ dom 𝑈) ⊆ dom 𝑇
14	12, 13	eqsstri 3954	. . 3 ⊢ dom (𝑈 ↾ dom 𝑇) ⊆ dom 𝑇
15	14	a1i 11	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → dom (𝑈 ↾ dom 𝑇) ⊆ dom 𝑇)
16		nodmord 28010	. . . . . . . 8 ⊢ (𝑇 ∈ No → Ord dom 𝑇)
17	3, 16	syl 18	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → Ord dom 𝑇)
18		ordsucss 7829	. . . . . . 7 ⊢ (Ord dom 𝑇 → (ℎ ∈ dom 𝑇 → suc ℎ ⊆ dom 𝑇))
19	17, 18	syl 18	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (ℎ ∈ dom 𝑇 → suc ℎ ⊆ dom 𝑇))
20	19	imp 412	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ ℎ ∈ dom 𝑇) → suc ℎ ⊆ dom 𝑇)
21	20	resabs1d 5998	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ ℎ ∈ dom 𝑇) → ((𝑈 ↾ dom 𝑇) ↾ suc ℎ) = (𝑈 ↾ suc ℎ))
22	1	noinfdm 28076	. . . . . . . . 9 ⊢ (¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 → dom 𝑇 = {ℎ ∣ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ)))})
23	22	eleq2d 2846	. . . . . . . 8 ⊢ (¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 → (ℎ ∈ dom 𝑇 ↔ ℎ ∈ {ℎ ∣ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ)))}))
24		abid 2742	. . . . . . . . 9 ⊢ (ℎ ∈ {ℎ ∣ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ)))} ↔ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ))))
25		breq2 5106	. . . . . . . . . . . . . 14 ⊢ (𝑞 = 𝑣 → (𝑝 <s 𝑞 ↔ 𝑝 <s 𝑣))
26	25	notbid 321	. . . . . . . . . . . . 13 ⊢ (𝑞 = 𝑣 → (¬ 𝑝 <s 𝑞 ↔ ¬ 𝑝 <s 𝑣))
27		reseq1 5963	. . . . . . . . . . . . . 14 ⊢ (𝑞 = 𝑣 → (𝑞 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))
28	27	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (𝑞 = 𝑣 → ((𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ) ↔ (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))
29	26, 28	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑣 → ((¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ)) ↔ (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
30	29	cbvralvw 3240	. . . . . . . . . . 11 ⊢ (∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ)) ↔ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))
31	30	anbi2i 635	. . . . . . . . . 10 ⊢ ((ℎ ∈ dom 𝑝 ∧ ∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ))) ↔ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
32	31	rexbii 3109	. . . . . . . . 9 ⊢ (∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ))) ↔ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
33	24, 32	bitri 278	. . . . . . . 8 ⊢ (ℎ ∈ {ℎ ∣ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑞 ∈ 𝐵 (¬ 𝑝 <s 𝑞 → (𝑝 ↾ suc ℎ) = (𝑞 ↾ suc ℎ)))} ↔ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
34	23, 33	bitrdi 290	. . . . . . 7 ⊢ (¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 → (ℎ ∈ dom 𝑇 ↔ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
35	34	3ad2ant1 1151	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (ℎ ∈ dom 𝑇 ↔ ∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
36		simpl2l 1245	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝐵 ⊆ No)
37		simprl 783	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑝 ∈ 𝐵)
38	36, 37	sseldd 3909	. . . . . . . . . . 11 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑝 ∈ No)
39	6	adantr 486	. . . . . . . . . . 11 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑈 ∈ No)
40		ltsso 28033	. . . . . . . . . . . 12 ⊢ <s Or No
41		soasym 5591	. . . . . . . . . . . 12 ⊢ (( <s Or No ∧ (𝑝 ∈ No ∧ 𝑈 ∈ No)) → (𝑝 <s 𝑈 → ¬ 𝑈 <s 𝑝))
42	40, 41	mpan 703	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ No ∧ 𝑈 ∈ No) → (𝑝 <s 𝑈 → ¬ 𝑈 <s 𝑝))
43	38, 39, 42	syl2anc 596	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑝 <s 𝑈 → ¬ 𝑈 <s 𝑝))
44		nodmon 28007	. . . . . . . . . . . . . 14 ⊢ (𝑝 ∈ No → dom 𝑝 ∈ On)
45	38, 44	syl 18	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → dom 𝑝 ∈ On)
46		simprrl 793	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ℎ ∈ dom 𝑝)
47		onelon 6387	. . . . . . . . . . . . 13 ⊢ ((dom 𝑝 ∈ On ∧ ℎ ∈ dom 𝑝) → ℎ ∈ On)
48	45, 46, 47	syl2anc 596	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ℎ ∈ On)
49		onsucb 7828	. . . . . . . . . . . 12 ⊢ (ℎ ∈ On ↔ suc ℎ ∈ On)
50	48, 49	sylib 221	. . . . . . . . . . 11 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → suc ℎ ∈ On)
51		ltsres 28019	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ No ∧ 𝑝 ∈ No ∧ suc ℎ ∈ On) → ((𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ) → 𝑈 <s 𝑝))
52	39, 38, 50, 51	syl3anc 1398	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ((𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ) → 𝑈 <s 𝑝))
53	43, 52	nsyld 157	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑝 <s 𝑈 → ¬ (𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ)))
54		noreson 28017	. . . . . . . . . . . . . 14 ⊢ ((𝑈 ∈ No ∧ suc ℎ ∈ On) → (𝑈 ↾ suc ℎ) ∈ No)
55	39, 50, 54	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑈 ↾ suc ℎ) ∈ No)
56		sonr 5582	. . . . . . . . . . . . . 14 ⊢ (( <s Or No ∧ (𝑈 ↾ suc ℎ) ∈ No) → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
57	40, 56	mpan 703	. . . . . . . . . . . . 13 ⊢ ((𝑈 ↾ suc ℎ) ∈ No → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
58	55, 57	syl 18	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
59	58	adantr 486	. . . . . . . . . . 11 ⊢ ((((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) ∧ ¬ 𝑝 <s 𝑈) → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
60		breq2 5106	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝑈 → (𝑝 <s 𝑣 ↔ 𝑝 <s 𝑈))
61	60	notbid 321	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑈 → (¬ 𝑝 <s 𝑣 ↔ ¬ 𝑝 <s 𝑈))
62		reseq1 5963	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝑈 → (𝑣 ↾ suc ℎ) = (𝑈 ↾ suc ℎ))
63	62	eqeq2d 2771	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑈 → ((𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ) ↔ (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ)))
64	61, 63	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑈 → ((¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)) ↔ (¬ 𝑝 <s 𝑈 → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ))))
65		simprrr 794	. . . . . . . . . . . . . 14 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))
66		simpl3 1212	. . . . . . . . . . . . . 14 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑈 ∈ 𝐵)
67	64, 65, 66	rspcdva 3577	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (¬ 𝑝 <s 𝑈 → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ)))
68	67	imp 412	. . . . . . . . . . . 12 ⊢ ((((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) ∧ ¬ 𝑝 <s 𝑈) → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ))
69	68	breq2d 5114	. . . . . . . . . . 11 ⊢ ((((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) ∧ ¬ 𝑝 <s 𝑈) → ((𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ) ↔ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ)))
70	59, 69	mtbird 328	. . . . . . . . . 10 ⊢ ((((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) ∧ ¬ 𝑝 <s 𝑈) → ¬ (𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ))
71	70	ex 418	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (¬ 𝑝 <s 𝑈 → ¬ (𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ)))
72	53, 71	pm2.61d 181	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ (𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ))
73		simpl1 1210	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥)
74		simpl2 1211	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉))
75	1	noinfres 28079	. . . . . . . . . 10 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑝 ∈ 𝐵 ∧ ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))) → (𝑇 ↾ suc ℎ) = (𝑝 ↾ suc ℎ))
76	73, 74, 37, 46, 65, 75	syl113anc 1409	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑇 ↾ suc ℎ) = (𝑝 ↾ suc ℎ))
77	76	breq2d 5114	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ((𝑈 ↾ suc ℎ) <s (𝑇 ↾ suc ℎ) ↔ (𝑈 ↾ suc ℎ) <s (𝑝 ↾ suc ℎ)))
78	72, 77	mtbird 328	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ (𝑈 ↾ suc ℎ) <s (𝑇 ↾ suc ℎ))
79	78	rexlimdvaa 3164	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (∃𝑝 ∈ 𝐵 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑝 <s 𝑣 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))) → ¬ (𝑈 ↾ suc ℎ) <s (𝑇 ↾ suc ℎ)))
80	35, 79	sylbid 243	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (ℎ ∈ dom 𝑇 → ¬ (𝑈 ↾ suc ℎ) <s (𝑇 ↾ suc ℎ)))
81	80	imp 412	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ ℎ ∈ dom 𝑇) → ¬ (𝑈 ↾ suc ℎ) <s (𝑇 ↾ suc ℎ))
82	21, 81	eqnbrtrd 5122	. . 3 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ ℎ ∈ dom 𝑇) → ¬ ((𝑈 ↾ dom 𝑇) ↾ suc ℎ) <s (𝑇 ↾ suc ℎ))
83	82	ralrimiva 3154	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ∀ℎ ∈ dom 𝑇 ¬ ((𝑈 ↾ dom 𝑇) ↾ suc ℎ) <s (𝑇 ↾ suc ℎ))
84		noresle 28054	. 2 ⊢ (((𝑇 ∈ No ∧ (𝑈 ↾ dom 𝑇) ∈ No) ∧ (dom 𝑇 ⊆ dom 𝑇 ∧ dom (𝑈 ↾ dom 𝑇) ⊆ dom 𝑇 ∧ ∀ℎ ∈ dom 𝑇 ¬ ((𝑈 ↾ dom 𝑇) ↾ suc ℎ) <s (𝑇 ↾ suc ℎ))) → ¬ (𝑈 ↾ dom 𝑇) <s 𝑇)
85	3, 10, 11, 15, 83, 84	syl23anc 1404	1 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ (𝑈 ↾ dom 𝑇) <s 𝑇)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 {cab 2738 ∀wral 3076 ∃wrex 3086 ⊆ wss 3895 ∩ cin 4089 ∪ cun 4149 ifcif 4481 {csn 4583 ⟨cop 4589 class class class wbr 5102 ↦ cmpt 5185 Or wor 5557 dom cdm 5650 ↾ cres 5652 Ord word 6361 Oncon0 6362 suc csuc 6364 ℩cio 6492 ‘cfv 6538 ℩crio 7376 1_oc1o 8469 Nocsur 27997 <s clts 27998

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-tp 4588 df-op 4590 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fo 6544 df-fv 6546 df-riota 7377 df-1o 8476 df-2o 8477 df-no 28000 df-lts 28001 df-bday 28002

This theorem is used by: noinfbnd1lem2 28081 noinfbnd1lem6 28085

W3C validator