Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  pwtrrVD Structured version   Visualization version   GIF version

Theorem pwtrrVD 46067
Description: Virtual deduction proof of pwtr 5427; see pwtrVD 46066 for the converse. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
pwtrrVD.1 𝐴 ∈ V
Assertion
Ref Expression
pwtrrVD (Tr 𝒫 𝐴 → Tr 𝐴)

Proof of Theorem pwtrrVD
Dummy variables 𝑧 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dftr2 5220 . . 3 (Tr 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴))
2 idn1 45817 . . . . . . . 8 (   Tr 𝒫 𝐴   ▶   Tr 𝒫 𝐴   )
3 idn2 45856 . . . . . . . . 9 (   Tr 𝒫 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)   ▶   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)   )
4 simpr 490 . . . . . . . . 9 ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
53, 4e2 45874 . . . . . . . 8 (   Tr 𝒫 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)   ▶   𝑦 ∈ 𝐴   )
6 pwtrrVD.1 . . . . . . . . 9 𝐴 ∈ V
76pwid 4584 . . . . . . . 8 𝐴 ∈ 𝒫 𝐴
8 trel 5226 . . . . . . . . 9 (Tr 𝒫 𝐴 → ((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝒫 𝐴) → 𝑦 ∈ 𝒫 𝐴))
98expd 421 . . . . . . . 8 (Tr 𝒫 𝐴 → (𝑦 ∈ 𝐴 → (𝐴 ∈ 𝒫 𝐴 → 𝑦 ∈ 𝒫 𝐴)))
102, 5, 7, 9e120 45906 . . . . . . 7 (   Tr 𝒫 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)   ▶   𝑦 ∈ 𝒫 𝐴   )
11 elpwi 4567 . . . . . . 7 (𝑦 ∈ 𝒫 𝐴 → 𝑦 ⊆ 𝐴)
1210, 11e2 45874 . . . . . 6 (   Tr 𝒫 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)   ▶   𝑦 ⊆ 𝐴   )
13 simpl 488 . . . . . . 7 ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝑦)
143, 13e2 45874 . . . . . 6 (   Tr 𝒫 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)   ▶   𝑧 ∈ 𝑦   )
15 ssel 3907 . . . . . 6 (𝑦 ⊆ 𝐴 → (𝑧 ∈ 𝑦 → 𝑧 ∈ 𝐴))
1612, 14, 15e22 45914 . . . . 5 (   Tr 𝒫 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)   ▶   𝑧 ∈ 𝐴   )
1716in2 45848 . . . 4 (   Tr 𝒫 𝐴   ▶   ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴)   )
1817gen12 45861 . . 3 (   Tr 𝒫 𝐴   ▶   ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴)   )
19 biimpr 223 . . 3 ((Tr 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴)) → (∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴) → Tr 𝐴))
201, 18, 19e01 45934 . 2 (   Tr 𝒫 𝐴   ▶   Tr 𝐴   )
2120in1 45814 1 (Tr 𝒫 𝐴 → Tr 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560  Tr wtr 5218
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-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-pw 4562  df-uni 4873  df-tr 5219  df-vd1 45813  df-vd2 45821
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator