Theorem supmax 9426

Description: The greatest element of a set is its supremum. Note that the converse is not true; the supremum might not be an element of the set considered. (Contributed by Jeff Hoffman, 17-Jun-2008.) (Proof shortened by OpenAI, 30-Mar-2020.)

Hypotheses

Ref	Expression
supmax.1	⊢ (𝜑 → 𝑅 Or 𝐴)
supmax.2	⊢ (𝜑 → 𝐶 ∈ 𝐴)
supmax.3	⊢ (𝜑 → 𝐶 ∈ 𝐵)
supmax.4	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ¬ 𝐶𝑅𝑦)

Assertion

Ref	Expression
supmax	⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = 𝐶)

Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑦,𝐶   𝑦,𝑅   𝜑,𝑦

Proof of Theorem supmax

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		supmax.1	. 2 ⊢ (𝜑 → 𝑅 Or 𝐴)
2		supmax.2	. 2 ⊢ (𝜑 → 𝐶 ∈ 𝐴)
3		supmax.4	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ¬ 𝐶𝑅𝑦)
4		supmax.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝐵)
5		simprr 772	. . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝐶)) → 𝑦𝑅𝐶)
6		breq2 5114	. . . 4 ⊢ (𝑧 = 𝐶 → (𝑦𝑅𝑧 ↔ 𝑦𝑅𝐶))
7	6	rspcev 3591	. . 3 ⊢ ((𝐶 ∈ 𝐵 ∧ 𝑦𝑅𝐶) → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)
8	4, 5, 7	syl2an2r 685	. 2 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝐶)) → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)
9	1, 2, 3, 8	eqsupd 9415	1 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃wrex 3054   class class class wbr 5110   Or wor 5548  supcsup 9398

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-po 5549  df-so 5550  df-iota 6467  df-riota 7347  df-sup 9400

This theorem is referenced by:  suppr  9430  gsumesum  34056  supfz  35723  mblfinlem2  37659