Theorem noinfbnd1lem6 27211

Description: Lemma for noinfbnd1 27212. 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 1200	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝐵 ⊆ No )
2		simp3 1139	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑈 ∈ 𝐵)
3	1, 2	sseldd 3982	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑈 ∈ No )
4		nofv 27140	. . . . 5 ⊢ (𝑈 ∈ No → ((𝑈‘dom 𝑇) = ∅ ∨ (𝑈‘dom 𝑇) = 1o ∨ (𝑈‘dom 𝑇) = 2o))
5	3, 4	syl 17	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ((𝑈‘dom 𝑇) = ∅ ∨ (𝑈‘dom 𝑇) = 1o ∨ (𝑈‘dom 𝑇) = 2o))
6		3oran 1110	. . . 4 ⊢ (((𝑈‘dom 𝑇) = ∅ ∨ (𝑈‘dom 𝑇) = 1o ∨ (𝑈‘dom 𝑇) = 2o) ↔ ¬ (¬ (𝑈‘dom 𝑇) = ∅ ∧ ¬ (𝑈‘dom 𝑇) = 1o ∧ ¬ (𝑈‘dom 𝑇) = 2o))
7	5, 6	sylib 217	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ (¬ (𝑈‘dom 𝑇) = ∅ ∧ ¬ (𝑈‘dom 𝑇) = 1o ∧ ¬ (𝑈‘dom 𝑇) = 2o))
8		simpl1 1192	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → ¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥)
9		simpl2 1193	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉))
10		simpl3 1194	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → 𝑈 ∈ 𝐵)
11		simpr 486	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → 𝑇 = (𝑈 ↾ dom 𝑇))
12	11	eqcomd 2739	. . . . . 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 27209	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ ∅)
15	8, 9, 10, 12, 14	syl112anc 1375	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝑈‘dom 𝑇) ≠ ∅)
16	15	neneqd 2946	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → ¬ (𝑈‘dom 𝑇) = ∅)
17	13	noinfbnd1lem3 27208	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ 1o)
18	8, 9, 10, 12, 17	syl112anc 1375	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝑈‘dom 𝑇) ≠ 1o)
19	18	neneqd 2946	. . . 4 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → ¬ (𝑈‘dom 𝑇) = 1o)
20	13	noinfbnd1lem5 27210	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇)) → (𝑈‘dom 𝑇) ≠ 2o)
21	8, 9, 10, 12, 20	syl112anc 1375	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) ∧ 𝑇 = (𝑈 ↾ dom 𝑇)) → (𝑈‘dom 𝑇) ≠ 2o)
22	21	neneqd 2946	. . . 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 815	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ 𝑇 = (𝑈 ↾ dom 𝑇))
25	13	noinfbnd1lem1 27206	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → ¬ (𝑈 ↾ dom 𝑇) <s 𝑇)
26	13	noinfno 27201	. . . 4 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) → 𝑇 ∈ No )
27	26	3ad2ant2 1135	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑇 ∈ No )
28		nodmon 27133	. . . . 5 ⊢ (𝑇 ∈ No → dom 𝑇 ∈ On)
29	27, 28	syl 17	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → dom 𝑇 ∈ On)
30		noreson 27143	. . . 4 ⊢ ((𝑈 ∈ No ∧ dom 𝑇 ∈ On) → (𝑈 ↾ dom 𝑇) ∈ No )
31	3, 29, 30	syl2anc 585	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → (𝑈 ↾ dom 𝑇) ∈ No )
32		sltso 27159	. . . 4 ⊢ <s Or No
33		solin 5612	. . . 4 ⊢ (( <s Or No ∧ (𝑇 ∈ No ∧ (𝑈 ↾ dom 𝑇) ∈ No )) → (𝑇 <s (𝑈 ↾ dom 𝑇) ∨ 𝑇 = (𝑈 ↾ dom 𝑇) ∨ (𝑈 ↾ dom 𝑇) <s 𝑇))
34	32, 33	mpan 689	. . 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 1474	1 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ 𝑈 ∈ 𝐵) → 𝑇 <s (𝑈 ↾ dom 𝑇))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 397   ∨ w3o 1087   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  {cab 2710   ≠ wne 2941  ∀wral 3062  ∃wrex 3071   ∪ cun 3945   ⊆ wss 3947  ∅c0 4321  ifcif 4527  {csn 4627  ⟨cop 4633   class class class wbr 5147   ↦ cmpt 5230   Or wor 5586  dom cdm 5675   ↾ cres 5677  Oncon0 6361  suc csuc 6363  ℩cio 6490  ‘cfv 6540  ℩crio 7359  1_oc1o 8454  2_oc2o 8455   No csur 27123   <s cslt 27124

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7720

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-tp 4632  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7360  df-1o 8461  df-2o 8462  df-no 27126  df-slt 27127  df-bday 27128

This theorem is referenced by:  noinfbnd1  27212