ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  trint GIF version

Theorem trint 4244
Description: The intersection of a class of transitive sets is transitive. Exercise 5(b) of [Enderton] p. 73. (Contributed by Scott Fenton, 25-Feb-2011.)
Assertion
Ref Expression
trint (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩ 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem trint
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dftr3 4233 . . . . . 6 (Tr 𝑥 ↔ ∀𝑦 ∈ 𝑥 𝑦 ⊆ 𝑥)
21ralbii 2556 . . . . 5 (∀𝑥 ∈ 𝐴 Tr 𝑥 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ⊆ 𝑥)
32biimpi 120 . . . 4 (∀𝑥 ∈ 𝐴 Tr 𝑥 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ⊆ 𝑥)
4 df-ral 2533 . . . . . 6 (∀𝑦 ∈ 𝑥 𝑦 ⊆ 𝑥 ↔ ∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
54ralbii 2556 . . . . 5 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ⊆ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
6 ralcom4 2844 . . . . 5 (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
75, 6bitri 184 . . . 4 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ⊆ 𝑥 ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
83, 7sylib 122 . . 3 (∀𝑥 ∈ 𝐴 Tr 𝑥 → ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
9 ralim 2609 . . . 4 (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥) → (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
109alimi 1508 . . 3 (∀𝑦∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥) → ∀𝑦(∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
118, 10syl 14 . 2 (∀𝑥 ∈ 𝐴 Tr 𝑥 → ∀𝑦(∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
12 dftr3 4233 . . 3 (Tr ∩ 𝐴 ↔ ∀𝑦 ∈ ∩ 𝐴𝑦 ⊆ ∩ 𝐴)
13 df-ral 2533 . . . 4 (∀𝑦 ∈ ∩ 𝐴𝑦 ⊆ ∩ 𝐴 ↔ ∀𝑦(𝑦 ∈ ∩ 𝐴 → 𝑦 ⊆ ∩ 𝐴))
14 vex 2824 . . . . . . 7 𝑦 ∈ V
1514elint2 3977 . . . . . 6 (𝑦 ∈ ∩ 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)
16 ssint 3986 . . . . . 6 (𝑦 ⊆ ∩ 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥)
1715, 16imbi12i 239 . . . . 5 ((𝑦 ∈ ∩ 𝐴 → 𝑦 ⊆ ∩ 𝐴) ↔ (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
1817albii 1523 . . . 4 (∀𝑦(𝑦 ∈ ∩ 𝐴 → 𝑦 ⊆ ∩ 𝐴) ↔ ∀𝑦(∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
1913, 18bitri 184 . . 3 (∀𝑦 ∈ ∩ 𝐴𝑦 ⊆ ∩ 𝐴 ↔ ∀𝑦(∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
2012, 19bitri 184 . 2 (Tr ∩ 𝐴 ↔ ∀𝑦(∀𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
2111, 20sylibr 134 1 (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩ 𝐴)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4  ∀wal 1400   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  ∩ cint 3970  Tr wtr 4229
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-in 3226  df-ss 3233  df-uni 3936  df-int 3971  df-tr 4230
This theorem is used by:  onintonm  4664
  Copyright terms: Public domain W3C validator