Theorem unielid 41954

Description: Two ways to say the union of a class is an element of that class. (Contributed by RP, 27-Jan-2025.)

Assertion

Ref	Expression
unielid	⊢ (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)

Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem unielid

Step	Hyp	Ref	Expression
1		ssid 4004	. 2 ⊢ 𝐴 ⊆ 𝐴
2		unielss 41953	. 2 ⊢ (𝐴 ⊆ 𝐴 → (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥))
3	1, 2	ax-mp 5	1 ⊢ (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)

Syntax hints:   ↔ wb 205   ∈ wcel 2107  ∀wral 3062  ∃wrex 3071   ⊆ wss 3948  ∪ cuni 4908

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-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-v 3477  df-in 3955  df-ss 3965  df-uni 4909

This theorem is referenced by:  onsupnmax  41963  onsupeqmax  41981  onsupeqnmax  41982