Theorem nosupbnd1lem4 27059

Description: Lemma for nosupbnd1 27062. If 𝑈 is a prolongment of 𝑆 and in 𝐴, then (𝑈‘dom 𝑆) is not undefined. (Contributed by Scott Fenton, 6-Dec-2021.)

Hypothesis

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

Assertion

Ref	Expression
nosupbnd1lem4	⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → (𝑈‘dom 𝑆) ≠ ∅)

Distinct variable groups:   𝐴,𝑔,𝑢,𝑣,𝑥,𝑦   𝑢,𝑈   𝑣,𝑢,𝑥,𝑦

Allowed substitution hints:   𝑆(𝑥,𝑦,𝑣,𝑢,𝑔)   𝑈(𝑥,𝑦,𝑣,𝑔)

Proof of Theorem nosupbnd1lem4

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1191	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → ¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
2		simpl2 1192	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
3		simprl 769	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑤 ∈ 𝐴)
4		simpl3 1193	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆))
5		simprr 771	. . . . . . . . . . 11 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑈 <s 𝑤)
6		simp2l 1199	. . . . . . . . . . . . 13 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → 𝐴 ⊆ No )
7		simp3l 1201	. . . . . . . . . . . . 13 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → 𝑈 ∈ 𝐴)
8	6, 7	sseldd 3945	. . . . . . . . . . . 12 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → 𝑈 ∈ No )
9		simpl2l 1226	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝐴 ⊆ No )
10	9, 3	sseldd 3945	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑤 ∈ No )
11		sltso 27024	. . . . . . . . . . . . 13 ⊢ <s Or No
12		soasym 5576	. . . . . . . . . . . . 13 ⊢ (( <s Or No ∧ (𝑈 ∈ No ∧ 𝑤 ∈ No )) → (𝑈 <s 𝑤 → ¬ 𝑤 <s 𝑈))
13	11, 12	mpan 688	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ No ∧ 𝑤 ∈ No ) → (𝑈 <s 𝑤 → ¬ 𝑤 <s 𝑈))
14	8, 10, 13	syl2an2r 683	. . . . . . . . . . 11 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑈 <s 𝑤 → ¬ 𝑤 <s 𝑈))
15	5, 14	mpd 15	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → ¬ 𝑤 <s 𝑈)
16	3, 15	jca 512	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑤 ∈ 𝐴 ∧ ¬ 𝑤 <s 𝑈))
17		nosupbnd1.1	. . . . . . . . . 10 ⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
18	17	nosupbnd1lem2 27057	. . . . . . . . 9 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ ((𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆) ∧ (𝑤 ∈ 𝐴 ∧ ¬ 𝑤 <s 𝑈))) → (𝑤 ↾ dom 𝑆) = 𝑆)
19	1, 2, 4, 16, 18	syl112anc 1374	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑤 ↾ dom 𝑆) = 𝑆)
20	17	nosupbnd1lem3 27058	. . . . . . . 8 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑤 ∈ 𝐴 ∧ (𝑤 ↾ dom 𝑆) = 𝑆)) → (𝑤‘dom 𝑆) ≠ 2o)
21	1, 2, 3, 19, 20	syl112anc 1374	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑤‘dom 𝑆) ≠ 2o)
22	21	neneqd 2948	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → ¬ (𝑤‘dom 𝑆) = 2o)
23	22	expr 457	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ 𝑤 ∈ 𝐴) → (𝑈 <s 𝑤 → ¬ (𝑤‘dom 𝑆) = 2o))
24		imnan 400	. . . . 5 ⊢ ((𝑈 <s 𝑤 → ¬ (𝑤‘dom 𝑆) = 2o) ↔ ¬ (𝑈 <s 𝑤 ∧ (𝑤‘dom 𝑆) = 2o))
25	23, 24	sylib 217	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ 𝑤 ∈ 𝐴) → ¬ (𝑈 <s 𝑤 ∧ (𝑤‘dom 𝑆) = 2o))
26	25	nrexdv 3146	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → ¬ ∃𝑤 ∈ 𝐴 (𝑈 <s 𝑤 ∧ (𝑤‘dom 𝑆) = 2o))
27		simpl3l 1228	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → 𝑈 ∈ 𝐴)
28		simpl1 1191	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → ¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
29		breq2 5109	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑢 <s 𝑤 ↔ 𝑢 <s 𝑦))
30	29	cbvrexvw 3226	. . . . . . . . 9 ⊢ (∃𝑤 ∈ 𝐴 𝑢 <s 𝑤 ↔ ∃𝑦 ∈ 𝐴 𝑢 <s 𝑦)
31		breq1 5108	. . . . . . . . . 10 ⊢ (𝑢 = 𝑥 → (𝑢 <s 𝑦 ↔ 𝑥 <s 𝑦))
32	31	rexbidv 3175	. . . . . . . . 9 ⊢ (𝑢 = 𝑥 → (∃𝑦 ∈ 𝐴 𝑢 <s 𝑦 ↔ ∃𝑦 ∈ 𝐴 𝑥 <s 𝑦))
33	30, 32	bitrid 282	. . . . . . . 8 ⊢ (𝑢 = 𝑥 → (∃𝑤 ∈ 𝐴 𝑢 <s 𝑤 ↔ ∃𝑦 ∈ 𝐴 𝑥 <s 𝑦))
34	33	cbvralvw 3225	. . . . . . 7 ⊢ (∀𝑢 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑢 <s 𝑤 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 <s 𝑦)
35		dfrex2 3076	. . . . . . . 8 ⊢ (∃𝑦 ∈ 𝐴 𝑥 <s 𝑦 ↔ ¬ ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
36	35	ralbii 3096	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 <s 𝑦 ↔ ∀𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
37		ralnex 3075	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ↔ ¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
38	34, 36, 37	3bitri 296	. . . . . 6 ⊢ (∀𝑢 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑢 <s 𝑤 ↔ ¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
39	28, 38	sylibr 233	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → ∀𝑢 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑢 <s 𝑤)
40		breq1 5108	. . . . . . 7 ⊢ (𝑢 = 𝑈 → (𝑢 <s 𝑤 ↔ 𝑈 <s 𝑤))
41	40	rexbidv 3175	. . . . . 6 ⊢ (𝑢 = 𝑈 → (∃𝑤 ∈ 𝐴 𝑢 <s 𝑤 ↔ ∃𝑤 ∈ 𝐴 𝑈 <s 𝑤))
42	41	rspcv 3577	. . . . 5 ⊢ (𝑈 ∈ 𝐴 → (∀𝑢 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑢 <s 𝑤 → ∃𝑤 ∈ 𝐴 𝑈 <s 𝑤))
43	27, 39, 42	sylc 65	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → ∃𝑤 ∈ 𝐴 𝑈 <s 𝑤)
44		simpl2l 1226	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → 𝐴 ⊆ No )
45	44, 27	sseldd 3945	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → 𝑈 ∈ No )
46	45	adantr 481	. . . . . . . 8 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑈 ∈ No )
47	44	adantr 481	. . . . . . . . 9 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝐴 ⊆ No )
48		simprl 769	. . . . . . . . 9 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑤 ∈ 𝐴)
49	47, 48	sseldd 3945	. . . . . . . 8 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑤 ∈ No )
50	17	nosupno 27051	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V) → 𝑆 ∈ No )
51	50	3ad2ant2 1134	. . . . . . . . . . 11 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → 𝑆 ∈ No )
52	51	adantr 481	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → 𝑆 ∈ No )
53	52	adantr 481	. . . . . . . . 9 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑆 ∈ No )
54		nodmon 26998	. . . . . . . . 9 ⊢ (𝑆 ∈ No → dom 𝑆 ∈ On)
55	53, 54	syl 17	. . . . . . . 8 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → dom 𝑆 ∈ On)
56		simpl3r 1229	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → (𝑈 ↾ dom 𝑆) = 𝑆)
57	56	adantr 481	. . . . . . . . 9 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑈 ↾ dom 𝑆) = 𝑆)
58		simpll1 1212	. . . . . . . . . 10 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → ¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦)
59		simpll2 1213	. . . . . . . . . 10 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
60		simpll3 1214	. . . . . . . . . 10 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆))
61		simprr 771	. . . . . . . . . . . 12 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → 𝑈 <s 𝑤)
62	45, 49, 13	syl2an2r 683	. . . . . . . . . . . 12 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑈 <s 𝑤 → ¬ 𝑤 <s 𝑈))
63	61, 62	mpd 15	. . . . . . . . . . 11 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → ¬ 𝑤 <s 𝑈)
64	48, 63	jca 512	. . . . . . . . . 10 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑤 ∈ 𝐴 ∧ ¬ 𝑤 <s 𝑈))
65	58, 59, 60, 64, 18	syl112anc 1374	. . . . . . . . 9 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑤 ↾ dom 𝑆) = 𝑆)
66	57, 65	eqtr4d 2779	. . . . . . . 8 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑈 ↾ dom 𝑆) = (𝑤 ↾ dom 𝑆))
67		simplr 767	. . . . . . . 8 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑈‘dom 𝑆) = ∅)
68		nolt02o 27043	. . . . . . . 8 ⊢ (((𝑈 ∈ No ∧ 𝑤 ∈ No ∧ dom 𝑆 ∈ On) ∧ ((𝑈 ↾ dom 𝑆) = (𝑤 ↾ dom 𝑆) ∧ 𝑈 <s 𝑤) ∧ (𝑈‘dom 𝑆) = ∅) → (𝑤‘dom 𝑆) = 2o)
69	46, 49, 55, 66, 61, 67, 68	syl321anc 1392	. . . . . . 7 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ (𝑤 ∈ 𝐴 ∧ 𝑈 <s 𝑤)) → (𝑤‘dom 𝑆) = 2o)
70	69	expr 457	. . . . . 6 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ 𝑤 ∈ 𝐴) → (𝑈 <s 𝑤 → (𝑤‘dom 𝑆) = 2o))
71	70	ancld 551	. . . . 5 ⊢ ((((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) ∧ 𝑤 ∈ 𝐴) → (𝑈 <s 𝑤 → (𝑈 <s 𝑤 ∧ (𝑤‘dom 𝑆) = 2o)))
72	71	reximdva 3165	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → (∃𝑤 ∈ 𝐴 𝑈 <s 𝑤 → ∃𝑤 ∈ 𝐴 (𝑈 <s 𝑤 ∧ (𝑤‘dom 𝑆) = 2o)))
73	43, 72	mpd 15	. . 3 ⊢ (((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) ∧ (𝑈‘dom 𝑆) = ∅) → ∃𝑤 ∈ 𝐴 (𝑈 <s 𝑤 ∧ (𝑤‘dom 𝑆) = 2o))
74	26, 73	mtand 814	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → ¬ (𝑈‘dom 𝑆) = ∅)
75	74	neqned 2950	1 ⊢ ((¬ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ∧ (𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝑈 ∈ 𝐴 ∧ (𝑈 ↾ dom 𝑆) = 𝑆)) → (𝑈‘dom 𝑆) ≠ ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  {cab 2713   ≠ wne 2943  ∀wral 3064  ∃wrex 3073  Vcvv 3445   ∪ cun 3908   ⊆ wss 3910  ∅c0 4282  ifcif 4486  {csn 4586  ⟨cop 4592   class class class wbr 5105   ↦ cmpt 5188   Or wor 5544  dom cdm 5633   ↾ cres 5635  Oncon0 6317  suc csuc 6319  ℩cio 6446  ‘cfv 6496  ℩crio 7312  2_oc2o 8406   No csur 26988   <s cslt 26989

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-1o 8412  df-2o 8413  df-no 26991  df-slt 26992  df-bday 26993

This theorem is referenced by:  nosupbnd1lem5  27060  nosupbnd1lem6  27061