Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  noinfbnd1lem2 Structured version   Visualization version   GIF version

Theorem noinfbnd1lem2 33572
Description: Lemma for noinfbnd1 33577. When there is no minimum, if any member of 𝐵 is a prolongment of 𝑇, then so are all elements below it. (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
noinfbnd1lem2 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → (𝑊 ↾ dom 𝑇) = 𝑇)
Distinct variable groups:   𝐵,𝑔,𝑢,𝑣,𝑥,𝑦   𝑣,𝑈   𝑥,𝑢,𝑦   𝑔,𝑉   𝑥,𝑣,𝑦   𝑣,𝑊
Allowed substitution hints:   𝑇(𝑥,𝑦,𝑣,𝑢,𝑔)   𝑈(𝑥,𝑦,𝑢,𝑔)   𝑉(𝑥,𝑦,𝑣,𝑢)   𝑊(𝑥,𝑦,𝑢,𝑔)

Proof of Theorem noinfbnd1lem2
StepHypRef Expression
1 simp3rl 1247 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → 𝑊𝐵)
2 noinfbnd1.1 . . . 4 𝑇 = if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
32noinfbnd1lem1 33571 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ 𝑊𝐵) → ¬ (𝑊 ↾ dom 𝑇) <s 𝑇)
41, 3syld3an3 1410 . 2 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → ¬ (𝑊 ↾ dom 𝑇) <s 𝑇)
5 simp3rr 1248 . . . 4 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → ¬ 𝑈 <s 𝑊)
6 simp2l 1200 . . . . . 6 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → 𝐵 No )
7 simp3ll 1245 . . . . . 6 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → 𝑈𝐵)
86, 7sseldd 3878 . . . . 5 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → 𝑈 No )
96, 1sseldd 3878 . . . . 5 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → 𝑊 No )
102noinfno 33566 . . . . . . 7 ((𝐵 No 𝐵𝑉) → 𝑇 No )
11103ad2ant2 1135 . . . . . 6 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → 𝑇 No )
12 nodmon 33498 . . . . . 6 (𝑇 No → dom 𝑇 ∈ On)
1311, 12syl 17 . . . . 5 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → dom 𝑇 ∈ On)
14 sltres 33510 . . . . 5 ((𝑈 No 𝑊 No ∧ dom 𝑇 ∈ On) → ((𝑈 ↾ dom 𝑇) <s (𝑊 ↾ dom 𝑇) → 𝑈 <s 𝑊))
158, 9, 13, 14syl3anc 1372 . . . 4 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → ((𝑈 ↾ dom 𝑇) <s (𝑊 ↾ dom 𝑇) → 𝑈 <s 𝑊))
165, 15mtod 201 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → ¬ (𝑈 ↾ dom 𝑇) <s (𝑊 ↾ dom 𝑇))
17 simp3lr 1246 . . . 4 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → (𝑈 ↾ dom 𝑇) = 𝑇)
1817breq1d 5040 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → ((𝑈 ↾ dom 𝑇) <s (𝑊 ↾ dom 𝑇) ↔ 𝑇 <s (𝑊 ↾ dom 𝑇)))
1916, 18mtbid 327 . 2 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))
20 noreson 33508 . . . 4 ((𝑊 No ∧ dom 𝑇 ∈ On) → (𝑊 ↾ dom 𝑇) ∈ No )
219, 13, 20syl2anc 587 . . 3 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → (𝑊 ↾ dom 𝑇) ∈ No )
22 sltso 33524 . . . 4 <s Or No
23 sotrieq2 5472 . . . 4 (( <s Or No ∧ ((𝑊 ↾ dom 𝑇) ∈ No 𝑇 No )) → ((𝑊 ↾ dom 𝑇) = 𝑇 ↔ (¬ (𝑊 ↾ dom 𝑇) <s 𝑇 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))))
2422, 23mpan 690 . . 3 (((𝑊 ↾ dom 𝑇) ∈ No 𝑇 No ) → ((𝑊 ↾ dom 𝑇) = 𝑇 ↔ (¬ (𝑊 ↾ dom 𝑇) <s 𝑇 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))))
2521, 11, 24syl2anc 587 . 2 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → ((𝑊 ↾ dom 𝑇) = 𝑇 ↔ (¬ (𝑊 ↾ dom 𝑇) <s 𝑇 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))))
264, 19, 25mpbir2and 713 1 ((¬ ∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 No 𝐵𝑉) ∧ ((𝑈𝐵 ∧ (𝑈 ↾ dom 𝑇) = 𝑇) ∧ (𝑊𝐵 ∧ ¬ 𝑈 <s 𝑊))) → (𝑊 ↾ dom 𝑇) = 𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  w3a 1088   = wceq 1542  wcel 2114  {cab 2716  wral 3053  wrex 3054  cun 3841  wss 3843  ifcif 4414  {csn 4516  cop 4522   class class class wbr 5030  cmpt 5110   Or wor 5441  dom cdm 5525  cres 5527  Oncon0 6172  suc csuc 6174  cio 6295  cfv 6339  crio 7128  1oc1o 8126   No csur 33488   <s cslt 33489
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2710  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pr 5296  ax-un 7481
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-ral 3058  df-rex 3059  df-reu 3060  df-rmo 3061  df-rab 3062  df-v 3400  df-sbc 3681  df-csb 3791  df-dif 3846  df-un 3848  df-in 3850  df-ss 3860  df-pss 3862  df-nul 4212  df-if 4415  df-pw 4490  df-sn 4517  df-pr 4519  df-tp 4521  df-op 4523  df-uni 4797  df-int 4837  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5429  df-eprel 5434  df-po 5442  df-so 5443  df-fr 5483  df-we 5485  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-rn 5536  df-res 5537  df-ima 5538  df-ord 6175  df-on 6176  df-suc 6178  df-iota 6297  df-fun 6341  df-fn 6342  df-f 6343  df-f1 6344  df-fo 6345  df-f1o 6346  df-fv 6347  df-riota 7129  df-1o 8133  df-2o 8134  df-no 33491  df-slt 33492  df-bday 33493
This theorem is referenced by:  noinfbnd1lem3  33573  noinfbnd1lem4  33574  noinfbnd1lem5  33575
  Copyright terms: Public domain W3C validator