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

Theorem supubti 6854
Description: A supremum is an upper bound. See also supclti 6853 and suplubti 6855.

This proof demonstrates how to expand an iota-based definition (df-iota 5058) using riotacl2 5711.

(Contributed by Jim Kingdon, 24-Nov-2021.)

Hypotheses
Ref Expression
supmoti.ti ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
supclti.2 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
Assertion
Ref Expression
supubti (𝜑 → (𝐶𝐵 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
Distinct variable groups:   𝑢,𝐴,𝑣,𝑥   𝑦,𝐴,𝑥,𝑧   𝑥,𝐵,𝑦,𝑧   𝑢,𝑅,𝑣,𝑥   𝑦,𝑅,𝑧   𝜑,𝑢,𝑣,𝑥
Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐵(𝑣,𝑢)   𝐶(𝑥,𝑦,𝑧,𝑣,𝑢)

Proof of Theorem supubti
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 simpl 108 . . . . 5 ((∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)) → ∀𝑦𝐵 ¬ 𝑥𝑅𝑦)
21a1i 9 . . . 4 (𝑥𝐴 → ((∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)) → ∀𝑦𝐵 ¬ 𝑥𝑅𝑦))
32ss2rabi 3149 . . 3 {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))} ⊆ {𝑥𝐴 ∣ ∀𝑦𝐵 ¬ 𝑥𝑅𝑦}
4 supmoti.ti . . . . 5 ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
5 supclti.2 . . . . 5 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
64, 5supval2ti 6850 . . . 4 (𝜑 → sup(𝐵, 𝐴, 𝑅) = (𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))))
74, 5supeuti 6849 . . . . 5 (𝜑 → ∃!𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
8 riotacl2 5711 . . . . 5 (∃!𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)) → (𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))) ∈ {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))})
97, 8syl 14 . . . 4 (𝜑 → (𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))) ∈ {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))})
106, 9eqeltrd 2194 . . 3 (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))})
113, 10sseldi 3065 . 2 (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ ∀𝑦𝐵 ¬ 𝑥𝑅𝑦})
12 breq2 3903 . . . . . . 7 (𝑦 = 𝑤 → (𝑥𝑅𝑦𝑥𝑅𝑤))
1312notbid 641 . . . . . 6 (𝑦 = 𝑤 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑅𝑤))
1413cbvralv 2631 . . . . 5 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ↔ ∀𝑤𝐵 ¬ 𝑥𝑅𝑤)
15 breq1 3902 . . . . . . 7 (𝑥 = sup(𝐵, 𝐴, 𝑅) → (𝑥𝑅𝑤 ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝑤))
1615notbid 641 . . . . . 6 (𝑥 = sup(𝐵, 𝐴, 𝑅) → (¬ 𝑥𝑅𝑤 ↔ ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝑤))
1716ralbidv 2414 . . . . 5 (𝑥 = sup(𝐵, 𝐴, 𝑅) → (∀𝑤𝐵 ¬ 𝑥𝑅𝑤 ↔ ∀𝑤𝐵 ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝑤))
1814, 17syl5bb 191 . . . 4 (𝑥 = sup(𝐵, 𝐴, 𝑅) → (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ↔ ∀𝑤𝐵 ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝑤))
1918elrab 2813 . . 3 (sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ ∀𝑦𝐵 ¬ 𝑥𝑅𝑦} ↔ (sup(𝐵, 𝐴, 𝑅) ∈ 𝐴 ∧ ∀𝑤𝐵 ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝑤))
2019simprbi 273 . 2 (sup(𝐵, 𝐴, 𝑅) ∈ {𝑥𝐴 ∣ ∀𝑦𝐵 ¬ 𝑥𝑅𝑦} → ∀𝑤𝐵 ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝑤)
21 breq2 3903 . . . 4 (𝑤 = 𝐶 → (sup(𝐵, 𝐴, 𝑅)𝑅𝑤 ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
2221notbid 641 . . 3 (𝑤 = 𝐶 → (¬ sup(𝐵, 𝐴, 𝑅)𝑅𝑤 ↔ ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
2322rspccv 2760 . 2 (∀𝑤𝐵 ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝑤 → (𝐶𝐵 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
2411, 20, 233syl 17 1 (𝜑 → (𝐶𝐵 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104   = wceq 1316  wcel 1465  wral 2393  wrex 2394  ∃!wreu 2395  {crab 2397   class class class wbr 3899  crio 5697  supcsup 6837
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 588  ax-in2 589  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-fal 1322  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-reu 2400  df-rmo 2401  df-rab 2402  df-v 2662  df-sbc 2883  df-un 3045  df-in 3047  df-ss 3054  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-br 3900  df-iota 5058  df-riota 5698  df-sup 6839
This theorem is referenced by:  suplub2ti  6856  supisoti  6865  inflbti  6879  suprubex  8677  zsupcl  11567  dvdslegcd  11580
  Copyright terms: Public domain W3C validator