Theorem tpssad 33022

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

Hypotheses

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

Assertion

Ref	Expression
tpssad	⊢ (𝜑 → 𝐴 ∈ 𝐷)

Proof of Theorem tpssad

Step	Hyp	Ref	Expression
1		tpssad.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2	1	adantr 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → 𝐴 ∈ 𝑉)
3		tpcomb 4715	. . . . 5 ⊢ {𝐴, 𝐵, 𝐶} = {𝐴, 𝐶, 𝐵}
4		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → ¬ 𝐵 ∈ V)
5	4	intnanrd 495	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → ¬ (𝐵 ∈ V ∧ 𝐵 ≠ 𝐶))
6		tpprceq3 4770	. . . . . 6 ⊢ (¬ (𝐵 ∈ V ∧ 𝐵 ≠ 𝐶) → {𝐴, 𝐶, 𝐵} = {𝐴, 𝐶})
7	5, 6	syl 18	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐶, 𝐵} = {𝐴, 𝐶})
8	3, 7	eqtrid 2809	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐶})
9		tpssad.2	. . . . 5 ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} ⊆ 𝐷)
10	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵, 𝐶} ⊆ 𝐷)
11	8, 10	eqsstrrd 3969	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐶} ⊆ 𝐷)
12	2, 11	prssad 33012	. 2 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ V) → 𝐴 ∈ 𝐷)
13	1	adantr 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → 𝐴 ∈ 𝑉)
14		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → ¬ 𝐶 ∈ V)
15	14	intnanrd 495	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → ¬ (𝐶 ∈ V ∧ 𝐶 ≠ 𝐵))
16		tpprceq3 4770	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐶 ≠ 𝐵) → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵})
17	15, 16	syl 18	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵})
18	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵, 𝐶} ⊆ 𝐷)
19	17, 18	eqsstrrd 3969	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ⊆ 𝐷)
20	13, 19	prssad 33012	. 2 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → 𝐴 ∈ 𝐷)
21	1	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ∈ 𝑉)
22		simprl 783	. . . 4 ⊢ ((𝜑 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐵 ∈ V)
23		simprr 785	. . . 4 ⊢ ((𝜑 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐶 ∈ V)
24	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → {𝐴, 𝐵, 𝐶} ⊆ 𝐷)
25		tpssg 33020	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ {𝐴, 𝐵, 𝐶} ⊆ 𝐷))
26	25	biimpar 483	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ {𝐴, 𝐵, 𝐶} ⊆ 𝐷) → (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷))
27	21, 22, 23, 24, 26	syl31anc 1400	. . 3 ⊢ ((𝜑 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷))
28	27	simp1d 1160	. 2 ⊢ ((𝜑 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ∈ 𝐷)
29	12, 20, 28	pm2.61dda 827	1 ⊢ (𝜑 → 𝐴 ∈ 𝐷)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  Vcvv 3453   ⊆ wss 3902  {cpr 4589  {ctp 4591

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-sn 4588  df-pr 4590  df-tp 4592

This theorem is used by:  tpssbd  33023  tpsscd  33024  constrlccllem  34271  constrcccllem  34272