Theorem supex2g 36605

Description: Existence of supremum. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
supex2g	⊢ (𝐴 ∈ 𝐶 → sup(𝐵, 𝐴, 𝑅) ∈ V)

Proof of Theorem supex2g

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-sup 9437	. 2 ⊢ sup(𝐵, 𝐴, 𝑅) = ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))}
2		rabexg 5332	. . 3 ⊢ (𝐴 ∈ 𝐶 → {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} ∈ V)
3	2	uniexd 7732	. 2 ⊢ (𝐴 ∈ 𝐶 → ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} ∈ V)
4	1, 3	eqeltrid 2838	1 ⊢ (𝐴 ∈ 𝐶 → sup(𝐵, 𝐴, 𝑅) ∈ V)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 397   ∈ wcel 2107  ∀wral 3062  ∃wrex 3071  {crab 3433  Vcvv 3475  ∪ cuni 4909   class class class wbr 5149  supcsup 9435

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-rab 3434  df-v 3477  df-in 3956  df-ss 3966  df-uni 4910  df-sup 9437

This theorem is referenced by: (None)