Theorem supelti 6958

Description: Supremum membership in a set. (Contributed by Jim Kingdon, 16-Jan-2022.)

Hypotheses

Ref	Expression
supelti.ti	⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
supelti.ex	⊢ (𝜑 → ∃𝑥 ∈ 𝐶 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
supelti.ss	⊢ (𝜑 → 𝐶 ⊆ 𝐴)

Assertion

Ref	Expression
supelti	⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐶)

Distinct variable groups:   𝑢,𝐴,𝑣,𝑥   𝑦,𝐴,𝑧,𝑥   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶   𝑢,𝑅,𝑣,𝑥   𝑦,𝑅,𝑧   𝜑,𝑢,𝑣,𝑥

Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐵(𝑣,𝑢)   𝐶(𝑦,𝑧,𝑣,𝑢)

Proof of Theorem supelti

Step	Hyp	Ref	Expression
1		supelti.ti	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
2		supelti.ss	. . . . . 6 ⊢ (𝜑 → 𝐶 ⊆ 𝐴)
3		supelti.ex	. . . . . 6 ⊢ (𝜑 → ∃𝑥 ∈ 𝐶 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
4		ssrexv 3202	. . . . . 6 ⊢ (𝐶 ⊆ 𝐴 → (∃𝑥 ∈ 𝐶 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))))
5	2, 3, 4	sylc 62	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
6	1, 5	supclti 6954	. . . 4 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐴)
7		elisset 2735	. . . 4 ⊢ (sup(𝐵, 𝐴, 𝑅) ∈ 𝐴 → ∃𝑥 𝑥 = sup(𝐵, 𝐴, 𝑅))
8	6, 7	syl 14	. . 3 ⊢ (𝜑 → ∃𝑥 𝑥 = sup(𝐵, 𝐴, 𝑅))
9		eqcom 2166	. . . 4 ⊢ (𝑥 = sup(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅) = 𝑥)
10	9	exbii 1592	. . 3 ⊢ (∃𝑥 𝑥 = sup(𝐵, 𝐴, 𝑅) ↔ ∃𝑥sup(𝐵, 𝐴, 𝑅) = 𝑥)
11	8, 10	sylib 121	. 2 ⊢ (𝜑 → ∃𝑥sup(𝐵, 𝐴, 𝑅) = 𝑥)
12		simpr 109	. . 3 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → sup(𝐵, 𝐴, 𝑅) = 𝑥)
13	1, 5	supval2ti 6951	. . . . . . . 8 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))))
14	13	eqeq1d 2173	. . . . . . 7 ⊢ (𝜑 → (sup(𝐵, 𝐴, 𝑅) = 𝑥 ↔ (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) = 𝑥))
15	14	biimpa 294	. . . . . 6 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) = 𝑥)
16	1, 5	supeuti 6950	. . . . . . . 8 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
17		riota1 5810	. . . . . . . 8 ⊢ (∃!𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → ((𝑥 ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ↔ (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) = 𝑥))
18	16, 17	syl 14	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ↔ (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) = 𝑥))
19	18	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → ((𝑥 ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ↔ (℩𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) = 𝑥))
20	15, 19	mpbird 166	. . . . 5 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → (𝑥 ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))))
21	20	simpld 111	. . . 4 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → 𝑥 ∈ 𝐴)
22	2, 3, 16	jca32 308	. . . . 5 ⊢ (𝜑 → (𝐶 ⊆ 𝐴 ∧ (∃𝑥 ∈ 𝐶 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ ∃!𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))))
23	20	simprd 113	. . . . 5 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
24		reupick 3401	. . . . 5 ⊢ (((𝐶 ⊆ 𝐴 ∧ (∃𝑥 ∈ 𝐶 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ ∃!𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) → (𝑥 ∈ 𝐶 ↔ 𝑥 ∈ 𝐴))
25	22, 23, 24	syl2an2r 585	. . . 4 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → (𝑥 ∈ 𝐶 ↔ 𝑥 ∈ 𝐴))
26	21, 25	mpbird 166	. . 3 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → 𝑥 ∈ 𝐶)
27	12, 26	eqeltrd 2241	. 2 ⊢ ((𝜑 ∧ sup(𝐵, 𝐴, 𝑅) = 𝑥) → sup(𝐵, 𝐴, 𝑅) ∈ 𝐶)
28	11, 27	exlimddv 1885	1 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1342  ∃wex 1479   ∈ wcel 2135  ∀wral 2442  ∃wrex 2443  ∃!wreu 2444   ⊆ wss 3111   class class class wbr 3976  ℩crio 5791  supcsup 6938

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 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-ext 2146

This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-reu 2449  df-rmo 2450  df-rab 2451  df-v 2723  df-sbc 2947  df-un 3115  df-in 3117  df-ss 3124  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-iota 5147  df-riota 5792  df-sup 6940

This theorem is referenced by:  zsupcl  11865