Theorem noinfbnd1lem6 27713

Description: Lemma for noinfbnd1 27714. Establish a hard lower bound when there is no minimum. (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
noinfbnd1lem6	⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑇 <s (𝑈 ↾ dom 𝑇))

Distinct variable groups:   𝐵,𝑔,𝑢,𝑣,𝑥,𝑦   𝑣,𝑈   𝑔,𝑉   𝑥,𝑈,𝑦

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

Proof of Theorem noinfbnd1lem6

Step	Hyp	Ref	Expression
1		simp2l 1201	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝐵 ⊆ No )
2		simp3 1139	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑈 ∈ 𝐵)
3	1, 2	sseldd 3936	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑈 ∈ No )
4		nofv 27642	. . . . 5 ⊢ (𝑈 ∈ No → ((𝑈‘dom 𝑇) = ∅ ∨ (𝑈‘dom 𝑇) = 1o ∨ (𝑈‘dom 𝑇) = 2o))
5	3, 4	syl 17	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ((𝑈‘dom 𝑇) = ∅ ∨ (𝑈‘dom 𝑇) = 1o ∨ (𝑈‘dom 𝑇) = 2o))
6		3oran 1109	. . . 4 ⊢ (((𝑈‘dom 𝑇) = ∅ ∨ (𝑈‘dom 𝑇) = 1o ∨ (𝑈‘dom 𝑇) = 2o) ↔ ¬ (¬ (𝑈‘dom 𝑇) = ∅ ∧ ¬ (𝑈‘dom 𝑇) = 1o ∧ ¬ (𝑈‘dom 𝑇) = 2o))
7	5, 6	sylib 218	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ (¬ (𝑈‘dom 𝑇) = ∅ ∧ ¬ (𝑈‘dom 𝑇) = 1o ∧ ¬ (𝑈‘dom 𝑇) = 2o))
8		simpl1 1193	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → ¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥)
9		simpl2 1194	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉))
10		simpl3 1195	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → 𝑈 ∈ 𝐵)
11		simpr 484	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → 𝑇 = (𝑈 ↾ dom 𝑇))
12	11	eqcomd 2743	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝑈 ↾ dom 𝑇) = 𝑇)
13		noinfbnd1.1	. . . . . . 7 ⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
14	13	noinfbnd1lem4 27711	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ ∅)
15	8, 9, 10, 12, 14	syl112anc 1377	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝑈‘dom 𝑇) ≠ ∅)
16	15	neneqd 2938	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → ¬ (𝑈‘dom 𝑇) = ∅)
17	13	noinfbnd1lem3 27710	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ 1o)
18	8, 9, 10, 12, 17	syl112anc 1377	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝑈‘dom 𝑇) ≠ 1o)
19	18	neneqd 2938	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → ¬ (𝑈‘dom 𝑇) = 1o)
20	13	noinfbnd1lem5 27712	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ 2o)
21	8, 9, 10, 12, 20	syl112anc 1377	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝑈‘dom 𝑇) ≠ 2o)
22	21	neneqd 2938	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → ¬ (𝑈‘dom 𝑇) = 2o)
23	16, 19, 22	3jca 1129	. . 3 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (¬ (𝑈‘dom 𝑇) = ∅ ∧ ¬ (𝑈‘dom 𝑇) = 1o ∧ ¬ (𝑈‘dom 𝑇) = 2o))
24	7, 23	mtand 816	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ 𝑇 = (𝑈 ↾ dom 𝑇))
25	13	noinfbnd1lem1 27708	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ (𝑈 ↾ dom 𝑇) <s 𝑇)
26	13	noinfno 27703	. . . 4 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) → 𝑇 ∈ No )
27	26	3ad2ant2 1135	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑇 ∈ No )
28		nodmon 27635	. . . . 5 ⊢ (𝑇 ∈ No → dom 𝑇 ∈ On)
29	27, 28	syl 17	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → dom 𝑇 ∈ On)
30		noreson 27645	. . . 4 ⊢ ((𝑈 ∈ No ∧ dom 𝑇 ∈ On) → (𝑈 ↾ dom 𝑇) ∈ No )
31	3, 29, 30	syl2anc 585	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (𝑈 ↾ dom 𝑇) ∈ No )
32		ltsso 27661	. . . 4 ⊢ <s Or No
33		solin 5569	. . . 4 ⊢ (( <s Or No ∧ (𝑇 ∈ No ∧ (𝑈 ↾ dom 𝑇) ∈ No )) → (𝑇 <s (𝑈 ↾ dom 𝑇) ∨ 𝑇 = (𝑈 ↾ dom 𝑇) ∨ (𝑈 ↾ dom 𝑇) <s 𝑇))
34	32, 33	mpan 691	. . 3 ⊢ ((𝑇 ∈ No ∧ (𝑈 ↾ dom 𝑇) ∈ No ) → (𝑇 <s (𝑈 ↾ dom 𝑇) ∨ 𝑇 = (𝑈 ↾ dom 𝑇) ∨ (𝑈 ↾ dom 𝑇) <s 𝑇))
35	27, 31, 34	syl2anc 585	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (𝑇 <s (𝑈 ↾ dom 𝑇) ∨ 𝑇 = (𝑈 ↾ dom 𝑇) ∨ (𝑈 ↾ dom 𝑇) <s 𝑇))
36	24, 25, 35	ecase23d 1476	1 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑇 <s (𝑈 ↾ dom 𝑇))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ w3o 1086   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {cab 2715   ≠ wne 2933  ∀wral 3052  ∃wrex 3062   ∪ cun 3901   ⊆ wss 3903  ∅c0 4287  ifcif 4481  {csn 4582  ⟨cop 4588   class class class wbr 5100   ↦ cmpt 5181   Or wor 5541  dom cdm 5634   ↾ cres 5636  Oncon0 6327  suc csuc 6329  ℩cio 6456  ‘cfv 6502  ℩crio 7326  1_oc1o 8402  2_oc2o 8403   No csur 27624   <s clts 27625

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ord 6330  df-on 6331  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-fo 6508  df-fv 6510  df-riota 7327  df-1o 8409  df-2o 8410  df-no 27627  df-lts 27628  df-bday 27629

This theorem is referenced by:  noinfbnd1  27714