ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  suplubti GIF version

Theorem suplubti 6602
Description: A supremum is the least upper bound. See also supclti 6600 and supubti 6601. (Contributed by Jim Kingdon, 24-Nov-2021.)
Hypotheses
Ref Expression
supmoti.ti ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
supclti.2 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
Assertion
Ref Expression
suplubti (𝜑 → ((𝐶𝐴𝐶𝑅sup(𝐵, 𝐴, 𝑅)) → ∃𝑧𝐵 𝐶𝑅𝑧))
Distinct variable groups:   𝑢,𝐴,𝑣,𝑥   𝑦,𝐴,𝑥,𝑧   𝑥,𝐵,𝑦,𝑧   𝑢,𝑅,𝑣,𝑥   𝑦,𝑅,𝑧   𝜑,𝑢,𝑣,𝑥   𝑧,𝐶
Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐵(𝑣,𝑢)   𝐶(𝑥,𝑦,𝑣,𝑢)

Proof of Theorem suplubti
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 simpr 108 . . . . . 6 ((∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)) → ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))
2 breq1 3814 . . . . . . . 8 (𝑦 = 𝑤 → (𝑦𝑅𝑥𝑤𝑅𝑥))
3 breq1 3814 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑦𝑅𝑧𝑤𝑅𝑧))
43rexbidv 2375 . . . . . . . 8 (𝑦 = 𝑤 → (∃𝑧𝐵 𝑦𝑅𝑧 ↔ ∃𝑧𝐵 𝑤𝑅𝑧))
52, 4imbi12d 232 . . . . . . 7 (𝑦 = 𝑤 → ((𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧) ↔ (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧)))
65cbvralv 2583 . . . . . 6 (∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧) ↔ ∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧))
71, 6sylib 120 . . . . 5 ((∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)) → ∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧))
87a1i 9 . . . 4 (𝑥𝐴 → ((∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)) → ∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧)))
98ss2rabi 3087 . . 3 {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))} ⊆ {𝑥𝐴 ∣ ∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧)}
10 supmoti.ti . . . . 5 ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
11 supclti.2 . . . . 5 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
1210, 11supval2ti 6597 . . . 4 (𝜑 → sup(𝐵, 𝐴, 𝑅) = (𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))))
1310, 11supeuti 6596 . . . . 5 (𝜑 → ∃!𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
14 riotacl2 5560 . . . . 5 (∃!𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)) → (𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))) ∈ {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))})
1513, 14syl 14 . . . 4 (𝜑 → (𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))) ∈ {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))})
1612, 15eqeltrd 2159 . . 3 (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))})
179, 16sseldi 3008 . 2 (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ ∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧)})
18 breq2 3815 . . . . . 6 (𝑥 = sup(𝐵, 𝐴, 𝑅) → (𝑤𝑅𝑥𝑤𝑅sup(𝐵, 𝐴, 𝑅)))
1918imbi1d 229 . . . . 5 (𝑥 = sup(𝐵, 𝐴, 𝑅) → ((𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧) ↔ (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝑤𝑅𝑧)))
2019ralbidv 2374 . . . 4 (𝑥 = sup(𝐵, 𝐴, 𝑅) → (∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧) ↔ ∀𝑤𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝑤𝑅𝑧)))
2120elrab 2759 . . 3 (sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ ∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧)} ↔ (sup(𝐵, 𝐴, 𝑅) ∈ 𝐴 ∧ ∀𝑤𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝑤𝑅𝑧)))
2221simprbi 269 . 2 (sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ ∀𝑤𝐴 (𝑤𝑅𝑥 → ∃𝑧𝐵 𝑤𝑅𝑧)} → ∀𝑤𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝑤𝑅𝑧))
23 breq1 3814 . . . . 5 (𝑤 = 𝐶 → (𝑤𝑅sup(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
24 breq1 3814 . . . . . 6 (𝑤 = 𝐶 → (𝑤𝑅𝑧𝐶𝑅𝑧))
2524rexbidv 2375 . . . . 5 (𝑤 = 𝐶 → (∃𝑧𝐵 𝑤𝑅𝑧 ↔ ∃𝑧𝐵 𝐶𝑅𝑧))
2623, 25imbi12d 232 . . . 4 (𝑤 = 𝐶 → ((𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝑤𝑅𝑧) ↔ (𝐶𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝐶𝑅𝑧)))
2726rspccv 2709 . . 3 (∀𝑤𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝑤𝑅𝑧) → (𝐶𝐴 → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝐶𝑅𝑧)))
2827impd 251 . 2 (∀𝑤𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧𝐵 𝑤𝑅𝑧) → ((𝐶𝐴𝐶𝑅sup(𝐵, 𝐴, 𝑅)) → ∃𝑧𝐵 𝐶𝑅𝑧))
2917, 22, 283syl 17 1 (𝜑 → ((𝐶𝐴𝐶𝑅sup(𝐵, 𝐴, 𝑅)) → ∃𝑧𝐵 𝐶𝑅𝑧))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wb 103   = wceq 1285  wcel 1434  wral 2353  wrex 2354  ∃!wreu 2355  {crab 2357   class class class wbr 3811  crio 5546  supcsup 6584
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-reu 2360  df-rmo 2361  df-rab 2362  df-v 2614  df-sbc 2827  df-un 2988  df-in 2990  df-ss 2997  df-sn 3428  df-pr 3429  df-op 3431  df-uni 3628  df-br 3812  df-iota 4934  df-riota 5547  df-sup 6586
This theorem is referenced by:  suplub2ti  6603  supisoti  6612  infglbti  6627  maxleast  10473
  Copyright terms: Public domain W3C validator