nosupbnd1lem1 - Metamath Proof Explorer

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

Theorem nosupbnd1lem1 28066

Description: Lemma for nosupbnd1 28072. Establish a soft upper bound. (Contributed by Scott Fenton, 5-Dec-2021.)

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

**Assertion**
Ref	Expression
nosupbnd1lem1	⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → ¬ 𝑆 <s (𝑈 ↾ dom 𝑆))

Distinct variable groups: 𝐴,𝑔,𝑢,𝑣,𝑥,𝑦 𝑣,𝑈 Allowed substitution hints: 𝑆(𝑥, 𝑦, 𝑣, 𝑢, 𝑔) 𝑈(𝑥, 𝑦, 𝑢, 𝑔)

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

Step	Hyp	Ref	Expression
1		simp2l 1218	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → 𝐴 ⊆ No)
2		simp3 1156	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → 𝑈 ∈ 𝐴)
3	1, 2	sseldd 3930	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → 𝑈 ∈ No)
4		nosupbnd1.1	. . . . . 6 ⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
5	4	nosupno 28061	. . . . 5 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V) → 𝑆 ∈ No)
6	5	3ad2ant2 1152	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → 𝑆 ∈ No)
7		nodmon 28008	. . . 4 ⊢ (𝑆 ∈ No → dom 𝑆 ∈ On)
8	6, 7	syl 18	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → dom 𝑆 ∈ On)
9		noreson 28018	. . 3 ⊢ ((𝑈 ∈ No ∧ dom 𝑆 ∈ On) → (𝑈 ↾ dom 𝑆) ∈ No)
10	3, 8, 9	syl2anc 596	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → (𝑈 ↾ dom 𝑆) ∈ No)
11		dmres 6003	. . . 4 ⊢ dom (𝑈 ↾ dom 𝑆) = (dom 𝑆 ∩ dom 𝑈)
12		inss1 4182	. . . 4 ⊢ (dom 𝑆 ∩ dom 𝑈) ⊆ dom 𝑆
13	11, 12	eqsstri 3975	. . 3 ⊢ dom (𝑈 ↾ dom 𝑆) ⊆ dom 𝑆
14	13	a1i 11	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → dom (𝑈 ↾ dom 𝑆) ⊆ dom 𝑆)
15		ssidd 3952	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → dom 𝑆 ⊆ dom 𝑆)
16		iffalse 4491	. . . . . . . . . . . 12 ⊢ (¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 → if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)))) = (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
17	4, 16	eqtrid 2808	. . . . . . . . . . 11 ⊢ (¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 → 𝑆 = (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
18	17	dmeqd 5887	. . . . . . . . . 10 ⊢ (¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 → dom 𝑆 = dom (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
19		iotaex 6515	. . . . . . . . . . 11 ⊢ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)) ∈ V
20		eqid 2761	. . . . . . . . . . 11 ⊢ (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))) = (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)))
21	19, 20	dmmpti 6684	. . . . . . . . . 10 ⊢ dom (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))) = {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))}
22	18, 21	eqtrdi 2812	. . . . . . . . 9 ⊢ (¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 → dom 𝑆 = {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))})
23	22	eleq2d 2847	. . . . . . . 8 ⊢ (¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 → (ℎ ∈ dom 𝑆 ↔ ℎ ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))}))
24		vex 3455	. . . . . . . . 9 ⊢ ℎ ∈ V
25		eleq1w 2844	. . . . . . . . . . . 12 ⊢ (𝑦 = ℎ → (𝑦 ∈ dom 𝑢 ↔ ℎ ∈ dom 𝑢))
26		suceq 6432	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ℎ → suc 𝑦 = suc ℎ)
27	26	reseq2d 5970	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ℎ → (𝑢 ↾ suc 𝑦) = (𝑢 ↾ suc ℎ))
28	26	reseq2d 5970	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ℎ → (𝑣 ↾ suc 𝑦) = (𝑣 ↾ suc ℎ))
29	27, 28	eqeq12d 2777	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ℎ → ((𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦) ↔ (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))
30	29	imbi2d 343	. . . . . . . . . . . . 13 ⊢ (𝑦 = ℎ → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)) ↔ (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
31	30	ralbidv 3186	. . . . . . . . . . . 12 ⊢ (𝑦 = ℎ → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
32	25, 31	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑦 = ℎ → ((𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ (ℎ ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
33	32	rexbidv 3187	. . . . . . . . . 10 ⊢ (𝑦 = ℎ → (∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ ∃𝑢 ∈ 𝐴 (ℎ ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
34		dmeq 5885	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑝 → dom 𝑢 = dom 𝑝)
35	34	eleq2d 2847	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑝 → (ℎ ∈ dom 𝑢 ↔ ℎ ∈ dom 𝑝))
36		breq2 5107	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = 𝑝 → (𝑣 <s 𝑢 ↔ 𝑣 <s 𝑝))
37	36	notbid 321	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑝 → (¬ 𝑣 <s 𝑢 ↔ ¬ 𝑣 <s 𝑝))
38		reseq1 5964	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = 𝑝 → (𝑢 ↾ suc ℎ) = (𝑝 ↾ suc ℎ))
39	38	eqeq1d 2763	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑝 → ((𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ) ↔ (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))
40	37, 39	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑝 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)) ↔ (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
41	40	ralbidv 3186	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑝 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
42	35, 41	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑝 → ((ℎ ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))) ↔ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
43	42	cbvrexvw 3242	. . . . . . . . . 10 ⊢ (∃𝑢 ∈ 𝐴 (ℎ ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))) ↔ ∃𝑝 ∈ 𝐴 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
44	33, 43	bitrdi 290	. . . . . . . . 9 ⊢ (𝑦 = ℎ → (∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ ∃𝑝 ∈ 𝐴 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
45	24, 44	elab 3633	. . . . . . . 8 ⊢ (ℎ ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↔ ∃𝑝 ∈ 𝐴 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))
46	23, 45	bitrdi 290	. . . . . . 7 ⊢ (¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 → (ℎ ∈ dom 𝑆 ↔ ∃𝑝 ∈ 𝐴 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
47	46	3ad2ant1 1151	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → (ℎ ∈ dom 𝑆 ↔ ∃𝑝 ∈ 𝐴 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))))
48		simpl1 1210	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
49		simpl2 1211	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
50		simprl 783	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑝 ∈ 𝐴)
51		simprrl 793	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ℎ ∈ dom 𝑝)
52		simprrr 794	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))
53	4	nosupres 28065	. . . . . . . . 9 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑝 ∈ 𝐴 ∧ ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)))) → (𝑆 ↾ suc ℎ) = (𝑝 ↾ suc ℎ))
54	48, 49, 50, 51, 52, 53	syl113anc 1409	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑆 ↾ suc ℎ) = (𝑝 ↾ suc ℎ))
55		simpl2l 1245	. . . . . . . . . . . . . . 15 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝐴 ⊆ No)
56	55, 50	sseldd 3930	. . . . . . . . . . . . . 14 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑝 ∈ No)
57	3	adantr 486	. . . . . . . . . . . . . 14 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑈 ∈ No)
58		ltsso 28034	. . . . . . . . . . . . . . 15 ⊢ <s Or No
59		soasym 5592	. . . . . . . . . . . . . . 15 ⊢ (( <s Or No ∧ (𝑝 ∈ No ∧ 𝑈 ∈ No)) → (𝑝 <s 𝑈 → ¬ 𝑈 <s 𝑝))
60	58, 59	mpan 703	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ No ∧ 𝑈 ∈ No) → (𝑝 <s 𝑈 → ¬ 𝑈 <s 𝑝))
61	56, 57, 60	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑝 <s 𝑈 → ¬ 𝑈 <s 𝑝))
62		simpl3 1212	. . . . . . . . . . . . . 14 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → 𝑈 ∈ 𝐴)
63		breq1 5106	. . . . . . . . . . . . . . . . 17 ⊢ (𝑣 = 𝑈 → (𝑣 <s 𝑝 ↔ 𝑈 <s 𝑝))
64	63	notbid 321	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝑈 → (¬ 𝑣 <s 𝑝 ↔ ¬ 𝑈 <s 𝑝))
65		reseq1 5964	. . . . . . . . . . . . . . . . 17 ⊢ (𝑣 = 𝑈 → (𝑣 ↾ suc ℎ) = (𝑈 ↾ suc ℎ))
66	65	eqeq2d 2772	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝑈 → ((𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ) ↔ (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ)))
67	64, 66	imbi12d 347	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑈 → ((¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)) ↔ (¬ 𝑈 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ))))
68	67	rspcv 3573	. . . . . . . . . . . . . 14 ⊢ (𝑈 ∈ 𝐴 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ)) → (¬ 𝑈 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ))))
69	62, 52, 68	sylc 66	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (¬ 𝑈 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ)))
70	61, 69	syld 48	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑝 <s 𝑈 → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ)))
71	70	imp 412	. . . . . . . . . . 11 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) ∧ 𝑝 <s 𝑈) → (𝑝 ↾ suc ℎ) = (𝑈 ↾ suc ℎ))
72		nodmon 28008	. . . . . . . . . . . . . . . . 17 ⊢ (𝑝 ∈ No → dom 𝑝 ∈ On)
73	56, 72	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → dom 𝑝 ∈ On)
74		onelon 6388	. . . . . . . . . . . . . . . 16 ⊢ ((dom 𝑝 ∈ On ∧ ℎ ∈ dom 𝑝) → ℎ ∈ On)
75	73, 51, 74	syl2anc 596	. . . . . . . . . . . . . . 15 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ℎ ∈ On)
76		onsucb 7829	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ On ↔ suc ℎ ∈ On)
77	75, 76	sylib 221	. . . . . . . . . . . . . 14 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → suc ℎ ∈ On)
78		noreson 28018	. . . . . . . . . . . . . 14 ⊢ ((𝑈 ∈ No ∧ suc ℎ ∈ On) → (𝑈 ↾ suc ℎ) ∈ No)
79	57, 77, 78	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑈 ↾ suc ℎ) ∈ No)
80		sonr 5583	. . . . . . . . . . . . . 14 ⊢ (( <s Or No ∧ (𝑈 ↾ suc ℎ) ∈ No) → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
81	58, 80	mpan 703	. . . . . . . . . . . . 13 ⊢ ((𝑈 ↾ suc ℎ) ∈ No → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
82	79, 81	syl 18	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
83	82	adantr 486	. . . . . . . . . . 11 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) ∧ 𝑝 <s 𝑈) → ¬ (𝑈 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
84	71, 83	eqnbrtrd 5123	. . . . . . . . . 10 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) ∧ 𝑝 <s 𝑈) → ¬ (𝑝 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
85	84	ex 418	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (𝑝 <s 𝑈 → ¬ (𝑝 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ)))
86		ltsres 28020	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ No ∧ 𝑈 ∈ No ∧ suc ℎ ∈ On) → ((𝑝 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ) → 𝑝 <s 𝑈))
87	56, 57, 77, 86	syl3anc 1398	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ((𝑝 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ) → 𝑝 <s 𝑈))
88	87	con3d 153	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → (¬ 𝑝 <s 𝑈 → ¬ (𝑝 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ)))
89	85, 88	pm2.61d 181	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ (𝑝 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
90	54, 89	eqnbrtrd 5123	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))))) → ¬ (𝑆 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
91	90	rexlimdvaa 3165	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → (∃𝑝 ∈ 𝐴 (ℎ ∈ dom 𝑝 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑝 → (𝑝 ↾ suc ℎ) = (𝑣 ↾ suc ℎ))) → ¬ (𝑆 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ)))
92	47, 91	sylbid 243	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → (ℎ ∈ dom 𝑆 → ¬ (𝑆 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ)))
93	92	imp 412	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ ℎ ∈ dom 𝑆) → ¬ (𝑆 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ))
94		nodmord 28011	. . . . . . . 8 ⊢ (𝑆 ∈ No → Ord dom 𝑆)
95		ordsucss 7830	. . . . . . . 8 ⊢ (Ord dom 𝑆 → (ℎ ∈ dom 𝑆 → suc ℎ ⊆ dom 𝑆))
96	6, 94, 95	3syl 19	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → (ℎ ∈ dom 𝑆 → suc ℎ ⊆ dom 𝑆))
97	96	imp 412	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ ℎ ∈ dom 𝑆) → suc ℎ ⊆ dom 𝑆)
98	97	resabs1d 5999	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ ℎ ∈ dom 𝑆) → ((𝑈 ↾ dom 𝑆) ↾ suc ℎ) = (𝑈 ↾ suc ℎ))
99	98	breq2d 5115	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ ℎ ∈ dom 𝑆) → ((𝑆 ↾ suc ℎ) <s ((𝑈 ↾ dom 𝑆) ↾ suc ℎ) ↔ (𝑆 ↾ suc ℎ) <s (𝑈 ↾ suc ℎ)))
100	93, 99	mtbird 328	. . 3 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) ∧ ℎ ∈ dom 𝑆) → ¬ (𝑆 ↾ suc ℎ) <s ((𝑈 ↾ dom 𝑆) ↾ suc ℎ))
101	100	ralrimiva 3155	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → ∀ℎ ∈ dom 𝑆 ¬ (𝑆 ↾ suc ℎ) <s ((𝑈 ↾ dom 𝑆) ↾ suc ℎ))
102		noresle 28055	. 2 ⊢ ((((𝑈 ↾ dom 𝑆) ∈ No ∧ 𝑆 ∈ No) ∧ (dom (𝑈 ↾ dom 𝑆) ⊆ dom 𝑆 ∧ dom 𝑆 ⊆ dom 𝑆 ∧ ∀ℎ ∈ dom 𝑆 ¬ (𝑆 ↾ suc ℎ) <s ((𝑈 ↾ dom 𝑆) ↾ suc ℎ))) → ¬ 𝑆 <s (𝑈 ↾ dom 𝑆))
103	10, 6, 14, 15, 101, 102	syl23anc 1404	1 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ 𝑈 ∈ 𝐴) → ¬ 𝑆 <s (𝑈 ↾ dom 𝑆))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {cab 2739 ∀wral 3077 ∃wrex 3087 Vcvv 3451 ∪ cun 3897 ∩ cin 3898 ⊆ wss 3914 ifcif 4482 {csn 4584 ⟨cop 4590 class class class wbr 5103 ↦ cmpt 5186 Or wor 5558 dom cdm 5651 ↾ cres 5653 Ord word 6362 Oncon0 6363 suc csuc 6365 ℩cio 6493 ‘cfv 6539 ℩crio 7377 2_oc2o 8471 Nocsur 27998 <s clts 27999

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7752

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3900 df-un 3902 df-in 3904 df-ss 3915 df-pss 4035 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6366 df-on 6367 df-suc 6369 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-fo 6545 df-fv 6547 df-riota 7378 df-1o 8477 df-2o 8478 df-no 28001 df-lts 28002 df-bday 28003

This theorem is used by: nosupbnd1lem2 28067 nosupbnd1lem6 28071

W3C validator