Users' Mathboxes Mathbox for Owen Orger < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eleqssii Structured version   Visualization version   GIF version

Theorem eleqssii 44493
Description: Transport membership by equality of the containing class and then by inclusion. Proof supplied by Owen Orger. AI assistance from OpenAI Codex in preparation and verification. (Contributed by Owen Orger, 11-Nov-2026.)
Hypotheses
Ref Expression
eleqssii.1 𝐴 ∈ 𝐵
eleqssii.2 𝐵 = 𝐶
eleqssii.3 𝐶 ⊆ 𝐷
Assertion
Ref Expression
eleqssii 𝐴 ∈ 𝐷

Proof of Theorem eleqssii
StepHypRef Expression
1 eleqssii.3 . 2 𝐶 ⊆ 𝐷
2 eleqssii.1 . . 3 𝐴 ∈ 𝐵
3 eleqssii.2 . . 3 𝐵 = 𝐶
42, 3eleqtri 2862 . 2 𝐴 ∈ 𝐶
51, 4sselii 3910 1 𝐴 ∈ 𝐷
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2755  df-clel 2839  df-ss 3901
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator