![]() |
Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > supex2g | Structured version Visualization version GIF version |
Description: Existence of supremum. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
supex2g | ⊢ (𝐴 ∈ 𝐶 → sup(𝐵, 𝐴, 𝑅) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sup 8890 | . 2 ⊢ sup(𝐵, 𝐴, 𝑅) = ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} | |
2 | rabexg 5198 | . . 3 ⊢ (𝐴 ∈ 𝐶 → {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} ∈ V) | |
3 | 2 | uniexd 7448 | . 2 ⊢ (𝐴 ∈ 𝐶 → ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} ∈ V) |
4 | 1, 3 | eqeltrid 2894 | 1 ⊢ (𝐴 ∈ 𝐶 → sup(𝐵, 𝐴, 𝑅) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 {crab 3110 Vcvv 3441 ∪ cuni 4800 class class class wbr 5030 supcsup 8888 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 ax-sep 5167 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-tru 1541 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-rab 3115 df-v 3443 df-in 3888 df-ss 3898 df-uni 4801 df-sup 8890 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |