Theorem trintALTVD 41586

Description: The intersection of a class of transitive sets is transitive. Virtual deduction proof of trintALT 41587. The following User's Proof is a Virtual Deduction proof completed automatically by the tools program completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant. trintALT 41587 is trintALTVD 41586 without virtual deductions and was automatically derived from trintALTVD 41586.

1::	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ▶   ∀𝑥 ∈ 𝐴Tr 𝑥   )
2::	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   )
3:2:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   𝑧 ∈ 𝑦   )
4:2:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   𝑦 ∈ ∩ 𝐴   )
5:4:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   ∀𝑞 ∈ 𝐴𝑦 ∈ 𝑞   )
6:5:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   (𝑞 ∈ 𝐴 → 𝑦 ∈ 𝑞)   )
7::	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴), 𝑞 ∈ 𝐴   ▶   𝑞 ∈ 𝐴   )
8:7,6:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴), 𝑞 ∈ 𝐴   ▶   𝑦 ∈ 𝑞   )
9:7,1:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴), 𝑞 ∈ 𝐴   ▶   [𝑞 / 𝑥]Tr 𝑥   )
10:7,9:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴), 𝑞 ∈ 𝐴   ▶   Tr 𝑞   )
11:10,3,8:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴), 𝑞 ∈ 𝐴   ▶   𝑧 ∈ 𝑞   )
12:11:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   (𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞)   )
13:12:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   ∀𝑞(𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞)   )
14:13:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   ∀𝑞 ∈ 𝐴𝑧 ∈ 𝑞   )
15:3,14:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   𝑧 ∈ ∩ 𝐴   )
16:15:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ▶   ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴)   )
17:16:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ▶   ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴)   )
18:17:	⊢ (   ∀𝑥 ∈ 𝐴Tr 𝑥   ▶   Tr ∩ 𝐴   )
qed:18:	⊢ (∀𝑥 ∈ 𝐴Tr 𝑥 → Tr ∩ 𝐴)

(Contributed by Alan Sare, 17-Apr-2012.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
trintALTVD	⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩ 𝐴)

Distinct variable group:   𝑥,𝐴

Proof of Theorem trintALTVD

Dummy variables 𝑞 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		idn2 41319	. . . . . . 7 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   )
2		simpl 486	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ 𝑦)
3	1, 2	e2 41337	. . . . . 6 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   𝑧 ∈ 𝑦   )
4		idn3 41321	. . . . . . . . . . 11 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ,   𝑞 ∈ 𝐴   ▶   𝑞 ∈ 𝐴   )
5		idn1 41280	. . . . . . . . . . . 12 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ▶   ∀𝑥 ∈ 𝐴 Tr 𝑥   )
6		rspsbc 3808	. . . . . . . . . . . 12 ⊢ (𝑞 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 Tr 𝑥 → [𝑞 / 𝑥]Tr 𝑥))
7	4, 5, 6	e31 41457	. . . . . . . . . . 11 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ,   𝑞 ∈ 𝐴   ▶   [𝑞 / 𝑥]Tr 𝑥   )
8		trsbc 41246	. . . . . . . . . . . 12 ⊢ (𝑞 ∈ 𝐴 → ([𝑞 / 𝑥]Tr 𝑥 ↔ Tr 𝑞))
9	8	biimpd 232	. . . . . . . . . . 11 ⊢ (𝑞 ∈ 𝐴 → ([𝑞 / 𝑥]Tr 𝑥 → Tr 𝑞))
10	4, 7, 9	e33 41440	. . . . . . . . . 10 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ,   𝑞 ∈ 𝐴   ▶   Tr 𝑞   )
11		simpr 488	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑦 ∈ ∩ 𝐴)
12	1, 11	e2 41337	. . . . . . . . . . . . 13 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   𝑦 ∈ ∩ 𝐴   )
13		elintg 4846	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ∩ 𝐴 → (𝑦 ∈ ∩ 𝐴 ↔ ∀𝑞 ∈ 𝐴 𝑦 ∈ 𝑞))
14	13	ibi 270	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ∩ 𝐴 → ∀𝑞 ∈ 𝐴 𝑦 ∈ 𝑞)
15	12, 14	e2 41337	. . . . . . . . . . . 12 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   ∀𝑞 ∈ 𝐴 𝑦 ∈ 𝑞   )
16		rsp 3170	. . . . . . . . . . . 12 ⊢ (∀𝑞 ∈ 𝐴 𝑦 ∈ 𝑞 → (𝑞 ∈ 𝐴 → 𝑦 ∈ 𝑞))
17	15, 16	e2 41337	. . . . . . . . . . 11 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   (𝑞 ∈ 𝐴 → 𝑦 ∈ 𝑞)   )
18		pm2.27 42	. . . . . . . . . . 11 ⊢ (𝑞 ∈ 𝐴 → ((𝑞 ∈ 𝐴 → 𝑦 ∈ 𝑞) → 𝑦 ∈ 𝑞))
19	4, 17, 18	e32 41464	. . . . . . . . . 10 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ,   𝑞 ∈ 𝐴   ▶   𝑦 ∈ 𝑞   )
20		trel 5143	. . . . . . . . . . 11 ⊢ (Tr 𝑞 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑞) → 𝑧 ∈ 𝑞))
21	20	expd 419	. . . . . . . . . 10 ⊢ (Tr 𝑞 → (𝑧 ∈ 𝑦 → (𝑦 ∈ 𝑞 → 𝑧 ∈ 𝑞)))
22	10, 3, 19, 21	e323 41472	. . . . . . . . 9 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ,   𝑞 ∈ 𝐴   ▶   𝑧 ∈ 𝑞   )
23	22	in3 41315	. . . . . . . 8 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   (𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞)   )
24	23	gen21 41325	. . . . . . 7 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   ∀𝑞(𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞)   )
25		df-ral 3111	. . . . . . . 8 ⊢ (∀𝑞 ∈ 𝐴 𝑧 ∈ 𝑞 ↔ ∀𝑞(𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞))
26	25	biimpri 231	. . . . . . 7 ⊢ (∀𝑞(𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞) → ∀𝑞 ∈ 𝐴 𝑧 ∈ 𝑞)
27	24, 26	e2 41337	. . . . . 6 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   ∀𝑞 ∈ 𝐴 𝑧 ∈ 𝑞   )
28		elintg 4846	. . . . . . 7 ⊢ (𝑧 ∈ 𝑦 → (𝑧 ∈ ∩ 𝐴 ↔ ∀𝑞 ∈ 𝐴 𝑧 ∈ 𝑞))
29	28	biimprd 251	. . . . . 6 ⊢ (𝑧 ∈ 𝑦 → (∀𝑞 ∈ 𝐴 𝑧 ∈ 𝑞 → 𝑧 ∈ ∩ 𝐴))
30	3, 27, 29	e22 41377	. . . . 5 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴)   ▶   𝑧 ∈ ∩ 𝐴   )
31	30	in2 41311	. . . 4 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ▶   ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴)   )
32	31	gen12 41324	. . 3 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ▶   ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴)   )
33		dftr2 5138	. . . 4 ⊢ (Tr ∩ 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴))
34	33	biimpri 231	. . 3 ⊢ (∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴) → Tr ∩ 𝐴)
35	32, 34	e1a 41333	. 2 ⊢ (   ∀𝑥 ∈ 𝐴 Tr 𝑥   ▶   Tr ∩ 𝐴   )
36	35	in1 41277	1 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩ 𝐴)

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1536   ∈ wcel 2111  ∀wral 3106  [wsbc 3720  ∩ cint 4838  Tr wtr 5136

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-v 3443  df-sbc 3721  df-in 3888  df-ss 3898  df-uni 4801  df-int 4839  df-tr 5137  df-vd1 41276  df-vd2 41284  df-vd3 41296

This theorem is referenced by: (None)