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

Theorem noinfbnd1lem4 27074
Description: Lemma for noinfbnd1 27077. If 𝑈 is a prolongment of 𝑇 and in 𝐵, then (𝑈‘dom 𝑇) is not undefined. (Contributed by Scott Fenton, 9-Aug-2024.)
Hypothesis
Ref Expression
noinfbnd1.1 𝑇 = if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
Assertion
Ref Expression
noinfbnd1lem4 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ ∅)
Distinct variable groups:   𝐵,𝑔,𝑢,𝑣,𝑥,𝑦   𝑣,𝑈   𝑥,𝑢,𝑦   𝑔,𝑉   𝑥,𝑣,𝑦,𝑈
Allowed substitution hints:   𝑇(𝑥,𝑦,𝑣,𝑢,𝑔)   𝑈(𝑢,𝑔)   𝑉(𝑥,𝑦,𝑣,𝑢)

Proof of Theorem noinfbnd1lem4
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 simpl1 1191 . . . . . . . 8 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → ¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
2 simpl2 1192 . . . . . . . 8 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝐵 No 𝐵𝑉))
3 simprl 769 . . . . . . . 8 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝑤𝐵)
4 simpl3 1193 . . . . . . . . 9 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇))
5 simp2l 1199 . . . . . . . . . . . . 13 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → 𝐵 No )
65sselda 3944 . . . . . . . . . . . 12 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ 𝑤𝐵) → 𝑤 No )
7 simp3l 1201 . . . . . . . . . . . . . 14 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → 𝑈𝐵)
85, 7sseldd 3945 . . . . . . . . . . . . 13 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → 𝑈 No )
98adantr 481 . . . . . . . . . . . 12 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ 𝑤𝐵) → 𝑈 No )
10 sltso 27024 . . . . . . . . . . . . 13 <s Or No
11 soasym 5576 . . . . . . . . . . . . 13 (( <s Or No ∧ (𝑤 No 𝑈 No )) → (𝑤 <s 𝑈 → ¬ 𝑈 <s 𝑤))
1210, 11mpan 688 . . . . . . . . . . . 12 ((𝑤 No 𝑈 No ) → (𝑤 <s 𝑈 → ¬ 𝑈 <s 𝑤))
136, 9, 12syl2anc 584 . . . . . . . . . . 11 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ 𝑤𝐵) → (𝑤 <s 𝑈 → ¬ 𝑈 <s 𝑤))
1413impr 455 . . . . . . . . . 10 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → ¬ 𝑈 <s 𝑤)
153, 14jca 512 . . . . . . . . 9 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤𝐵 ∧ ¬ 𝑈 <s 𝑤))
16 noinfbnd1.1 . . . . . . . . . 10 𝑇 = if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
1716noinfbnd1lem2 27072 . . . . . . . . 9 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑤𝐵 ∧ ¬ 𝑈 <s 𝑤))) → (𝑤 ↾ dom 𝑇) = 𝑇)
181, 2, 4, 15, 17syl112anc 1374 . . . . . . . 8 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤 ↾ dom 𝑇) = 𝑇)
1916noinfbnd1lem3 27073 . . . . . . . 8 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑤𝐵 ∧ (𝑤 ↾ dom 𝑇) = 𝑇)) → (𝑤‘dom 𝑇) ≠ 1o)
201, 2, 3, 18, 19syl112anc 1374 . . . . . . 7 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤‘dom 𝑇) ≠ 1o)
2120neneqd 2948 . . . . . 6 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑤𝐵𝑤 <s 𝑈)) → ¬ (𝑤‘dom 𝑇) = 1o)
2221expr 457 . . . . 5 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ 𝑤𝐵) → (𝑤 <s 𝑈 → ¬ (𝑤‘dom 𝑇) = 1o))
23 imnan 400 . . . . 5 ((𝑤 <s 𝑈 → ¬ (𝑤‘dom 𝑇) = 1o) ↔ ¬ (𝑤 <s 𝑈 ∧ (𝑤‘dom 𝑇) = 1o))
2422, 23sylib 217 . . . 4 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ 𝑤𝐵) → ¬ (𝑤 <s 𝑈 ∧ (𝑤‘dom 𝑇) = 1o))
2524nrexdv 3146 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → ¬ ∃𝑤𝐵 (𝑤 <s 𝑈 ∧ (𝑤‘dom 𝑇) = 1o))
26 breq2 5109 . . . . . . 7 (𝑥 = 𝑈 → (𝑦 <s 𝑥𝑦 <s 𝑈))
2726rexbidv 3175 . . . . . 6 (𝑥 = 𝑈 → (∃𝑦𝐵 𝑦 <s 𝑥 ↔ ∃𝑦𝐵 𝑦 <s 𝑈))
28 simpl1 1191 . . . . . . 7 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → ¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
29 dfral2 3102 . . . . . . . 8 (∀𝑥𝐵𝑦𝐵 𝑦 <s 𝑥 ↔ ¬ ∃𝑥𝐵 ¬ ∃𝑦𝐵 𝑦 <s 𝑥)
30 ralnex 3075 . . . . . . . . 9 (∀𝑦𝐵 ¬ 𝑦 <s 𝑥 ↔ ¬ ∃𝑦𝐵 𝑦 <s 𝑥)
3130rexbii 3097 . . . . . . . 8 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ↔ ∃𝑥𝐵 ¬ ∃𝑦𝐵 𝑦 <s 𝑥)
3229, 31xchbinxr 334 . . . . . . 7 (∀𝑥𝐵𝑦𝐵 𝑦 <s 𝑥 ↔ ¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
3328, 32sylibr 233 . . . . . 6 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → ∀𝑥𝐵𝑦𝐵 𝑦 <s 𝑥)
34 simpl3l 1228 . . . . . 6 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → 𝑈𝐵)
3527, 33, 34rspcdva 3582 . . . . 5 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → ∃𝑦𝐵 𝑦 <s 𝑈)
36 breq1 5108 . . . . . 6 (𝑦 = 𝑤 → (𝑦 <s 𝑈𝑤 <s 𝑈))
3736cbvrexvw 3226 . . . . 5 (∃𝑦𝐵 𝑦 <s 𝑈 ↔ ∃𝑤𝐵 𝑤 <s 𝑈)
3835, 37sylib 217 . . . 4 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → ∃𝑤𝐵 𝑤 <s 𝑈)
39 simpl2l 1226 . . . . . . . . . 10 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → 𝐵 No )
4039adantr 481 . . . . . . . . 9 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝐵 No )
41 simprl 769 . . . . . . . . 9 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝑤𝐵)
4240, 41sseldd 3945 . . . . . . . 8 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝑤 No )
4334adantr 481 . . . . . . . . 9 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝑈𝐵)
4440, 43sseldd 3945 . . . . . . . 8 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝑈 No )
45 simpl2 1192 . . . . . . . . . . 11 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → (𝐵 No 𝐵𝑉))
4616noinfno 27066 . . . . . . . . . . 11 ((𝐵 No 𝐵𝑉) → 𝑇 No )
4745, 46syl 17 . . . . . . . . . 10 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → 𝑇 No )
4847adantr 481 . . . . . . . . 9 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝑇 No )
49 nodmon 26998 . . . . . . . . 9 (𝑇 No → dom 𝑇 ∈ On)
5048, 49syl 17 . . . . . . . 8 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → dom 𝑇 ∈ On)
51 simpll1 1212 . . . . . . . . . 10 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → ¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥)
52 simpll2 1213 . . . . . . . . . 10 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝐵 No 𝐵𝑉))
53 simpll3 1214 . . . . . . . . . 10 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇))
54 simprr 771 . . . . . . . . . . . 12 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → 𝑤 <s 𝑈)
5542, 44, 12syl2anc 584 . . . . . . . . . . . 12 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤 <s 𝑈 → ¬ 𝑈 <s 𝑤))
5654, 55mpd 15 . . . . . . . . . . 11 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → ¬ 𝑈 <s 𝑤)
5741, 56jca 512 . . . . . . . . . 10 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤𝐵 ∧ ¬ 𝑈 <s 𝑤))
5851, 52, 53, 57, 17syl112anc 1374 . . . . . . . . 9 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤 ↾ dom 𝑇) = 𝑇)
59 simpl3r 1229 . . . . . . . . . 10 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → (𝑈 ↾ dom 𝑇) = 𝑇)
6059adantr 481 . . . . . . . . 9 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑈 ↾ dom 𝑇) = 𝑇)
6158, 60eqtr4d 2779 . . . . . . . 8 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤 ↾ dom 𝑇) = (𝑈 ↾ dom 𝑇))
62 simplr 767 . . . . . . . 8 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑈‘dom 𝑇) = ∅)
63 nogt01o 27044 . . . . . . . 8 (((𝑤 No 𝑈 No ∧ dom 𝑇 ∈ On) ∧ ((𝑤 ↾ dom 𝑇) = (𝑈 ↾ dom 𝑇) ∧ 𝑤 <s 𝑈) ∧ (𝑈‘dom 𝑇) = ∅) → (𝑤‘dom 𝑇) = 1o)
6442, 44, 50, 61, 54, 62, 63syl321anc 1392 . . . . . . 7 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ (𝑤𝐵𝑤 <s 𝑈)) → (𝑤‘dom 𝑇) = 1o)
6564expr 457 . . . . . 6 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ 𝑤𝐵) → (𝑤 <s 𝑈 → (𝑤‘dom 𝑇) = 1o))
6665ancld 551 . . . . 5 ((((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) ∧ 𝑤𝐵) → (𝑤 <s 𝑈 → (𝑤 <s 𝑈 ∧ (𝑤‘dom 𝑇) = 1o)))
6766reximdva 3165 . . . 4 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → (∃𝑤𝐵 𝑤 <s 𝑈 → ∃𝑤𝐵 (𝑤 <s 𝑈 ∧ (𝑤‘dom 𝑇) = 1o)))
6838, 67mpd 15 . . 3 (((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) ∧ (𝑈‘dom 𝑇) = ∅) → ∃𝑤𝐵 (𝑤 <s 𝑈 ∧ (𝑤‘dom 𝑇) = 1o))
6925, 68mtand 814 . 2 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → ¬ (𝑈‘dom 𝑇) = ∅)
7069neqned 2950 1 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ (𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  {cab 2713  wne 2943  wral 3064  wrex 3073  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  1oc1o 8405   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:  noinfbnd1lem5  27075  noinfbnd1lem6  27076
  Copyright terms: Public domain W3C validator