Theorem sstrALT2 38092

Description: Virtual deduction proof of sstr 3576, transitivity of subclasses, Theorem 6 of [Suppes] p. 23. This theorem was automatically generated from sstrALT2VD 38091 using the command file translate_without_overwriting.cmd . It was not minimized because the automated minimization excluding duplicates generates a minimized proof which, although not directly containing any duplicates, indirectly contains a duplicate. That is, the trace back of the minimized proof contains a duplicate. This is undesirable because some step(s) of the minimized proof use the proven theorem. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
sstrALT2	⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶)

Proof of Theorem sstrALT2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfss2 3557	. 2 ⊢ (𝐴 ⊆ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶))
2		id 22	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶))
3		simpr 476	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐵 ⊆ 𝐶)
4	2, 3	syl 17	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐵 ⊆ 𝐶)
5		simpl 472	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐵)
6	2, 5	syl 17	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐵)
7		idd 24	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐴))
8		ssel2 3563	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵)
9	6, 7, 8	syl6an 566	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
10		ssel2 3563	. . . . 5 ⊢ ((𝐵 ⊆ 𝐶 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶)
11	4, 9, 10	syl6an 566	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶))
12	11	idiALT 37704	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶))
13	12	alrimiv 1842	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶))
14		biimpr 209	. 2 ⊢ ((𝐴 ⊆ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶)) → (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → 𝐴 ⊆ 𝐶))
15	1, 13, 14	mpsyl 66	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶)

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383  ∀wal 1473   ∈ wcel 1977   ⊆ wss 3540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-in 3547  df-ss 3554

This theorem is referenced by: (None)