Theorem suplubti 6993

Description: A supremum is the least upper bound. See also supclti 6991 and supubti 6992. (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.

Step	Hyp	Ref	Expression
1		simpr 110	. . . . . 6 ⊢ ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))
2		breq1 4003	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → (𝑦𝑅𝑥 ↔ 𝑤𝑅𝑥))
3		breq1 4003	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → (𝑦𝑅𝑧 ↔ 𝑤𝑅𝑧))
4	3	rexbidv 2478	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → (∃𝑧 ∈ 𝐵 𝑦𝑅𝑧 ↔ ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧))
5	2, 4	imbi12d 234	. . . . . . 7 ⊢ (𝑦 = 𝑤 → ((𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)))
6	5	cbvralv 2703	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧))
7	1, 6	sylib 122	. . . . 5 ⊢ ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧))
8	7	a1i 9	. . . 4 ⊢ (𝑥 ∈ 𝐴 → ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)))
9	8	ss2rabi 3237	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} ⊆ {𝑥 ∈ 𝐴 ∣ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)}
10		supmoti.ti	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
11		supclti.2	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
12	10, 11	supval2ti 6988	. . . 4 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))))
13	10, 11	supeuti 6987	. . . . 5 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
14		riotacl2 5838	. . . . 5 ⊢ (∃!𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ∈ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))})
15	13, 14	syl 14	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ∈ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))})
16	12, 15	eqeltrd 2254	. . 3 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))})
17	9, 16	sselid 3153	. 2 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)})
18		breq2 4004	. . . . . 6 ⊢ (𝑥 = sup(𝐵, 𝐴, 𝑅) → (𝑤𝑅𝑥 ↔ 𝑤𝑅sup(𝐵, 𝐴, 𝑅)))
19	18	imbi1d 231	. . . . 5 ⊢ (𝑥 = sup(𝐵, 𝐴, 𝑅) → ((𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧) ↔ (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)))
20	19	ralbidv 2477	. . . 4 ⊢ (𝑥 = sup(𝐵, 𝐴, 𝑅) → (∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧) ↔ ∀𝑤 ∈ 𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)))
21	20	elrab 2893	. . 3 ⊢ (sup(𝐵, 𝐴, 𝑅) ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)} ↔ (sup(𝐵, 𝐴, 𝑅) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)))
22	21	simprbi 275	. 2 ⊢ (sup(𝐵, 𝐴, 𝑅) ∈ {𝑥 ∈ 𝐴 ∣ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)} → ∀𝑤 ∈ 𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧))
23		breq1 4003	. . . . 5 ⊢ (𝑤 = 𝐶 → (𝑤𝑅sup(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
24		breq1 4003	. . . . . 6 ⊢ (𝑤 = 𝐶 → (𝑤𝑅𝑧 ↔ 𝐶𝑅𝑧))
25	24	rexbidv 2478	. . . . 5 ⊢ (𝑤 = 𝐶 → (∃𝑧 ∈ 𝐵 𝑤𝑅𝑧 ↔ ∃𝑧 ∈ 𝐵 𝐶𝑅𝑧))
26	23, 25	imbi12d 234	. . . 4 ⊢ (𝑤 = 𝐶 → ((𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧) ↔ (𝐶𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝐶𝑅𝑧)))
27	26	rspccv 2838	. . 3 ⊢ (∀𝑤 ∈ 𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧) → (𝐶 ∈ 𝐴 → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝐶𝑅𝑧)))
28	27	impd 254	. 2 ⊢ (∀𝑤 ∈ 𝐴 (𝑤𝑅sup(𝐵, 𝐴, 𝑅) → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧) → ((𝐶 ∈ 𝐴 ∧ 𝐶𝑅sup(𝐵, 𝐴, 𝑅)) → ∃𝑧 ∈ 𝐵 𝐶𝑅𝑧))
29	17, 22, 28	3syl 17	1 ⊢ (𝜑 → ((𝐶 ∈ 𝐴 ∧ 𝐶𝑅sup(𝐵, 𝐴, 𝑅)) → ∃𝑧 ∈ 𝐵 𝐶𝑅𝑧))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  ∃!wreu 2457  {crab 2459   class class class wbr 4000  ℩crio 5824  supcsup 6975

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-iota 5174  df-riota 5825  df-sup 6977

This theorem is referenced by:  suplub2ti  6994  supisoti  7003  infglbti  7018  sup3exmid  8903  maxleast  11206