Theorem prssad 32785

Description: If a pair is a subset of a class, the first element of the pair is an element of that class. (Contributed by Thierry Arnoux, 2-Nov-2025.)

Hypotheses

Ref	Expression
prssad.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
prssad.2	⊢ (𝜑 → {𝐴, 𝐵} ⊆ 𝐶)

Assertion

Ref	Expression
prssad	⊢ (𝜑 → 𝐴 ∈ 𝐶)

Proof of Theorem prssad

Step	Hyp	Ref	Expression
1		prssad.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2	1	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐴 ∈ 𝑉)
3		simpr 489	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐵 ∈ V)
4		prssad.2	. . . . 5 ⊢ (𝜑 → {𝐴, 𝐵} ⊆ 𝐶)
5	4	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → {𝐴, 𝐵} ⊆ 𝐶)
6		prssg 4780	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ V) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ {𝐴, 𝐵} ⊆ 𝐶))
7	6	biimpar 482	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ V) ∧ {𝐴, 𝐵} ⊆ 𝐶) → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶))
8	2, 3, 5, 7	syl21anc 850	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶))
9	8	simpld 499	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐴 ∈ 𝐶)
10		prprc2 4728	. . . . 5 ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴})
11	10	adantl 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵} = {𝐴})
12	4	adantr 485	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵} ⊆ 𝐶)
13	11, 12	eqsstrrd 3974	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → {𝐴} ⊆ 𝐶)
14		snssg 4745	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐶 ↔ {𝐴} ⊆ 𝐶))
15	14	biimpar 482	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ {𝐴} ⊆ 𝐶) → 𝐴 ∈ 𝐶)
16	1, 13, 15	syl2an2r 697	. 2 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → 𝐴 ∈ 𝐶)
17	9, 16	pm2.61dan 824	1 ⊢ (𝜑 → 𝐴 ∈ 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1563   ∈ wcel 2145  Vcvv 3457   ⊆ wss 3907  {csn 4585  {cpr 4587

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-dif 3910  df-un 3912  df-ss 3924  df-nul 4289  df-sn 4586  df-pr 4588

This theorem is referenced by:  tpssad  32795  constrllcllem  34059  constrlccllem  34060