Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-indint GIF version

Theorem bj-indint 17123
Description: The property of being an inductive class is closed under intersections. (Contributed by BJ, 30-Nov-2019.)
Assertion
Ref Expression
bj-indint Ind ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥}
Distinct variable group:   𝑥,𝐴

Proof of Theorem bj-indint
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 df-bj-ind 17119 . . . . 5 (Ind 𝑥 ↔ (∅ ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 suc 𝑦 ∈ 𝑥))
21simplbi 274 . . . 4 (Ind 𝑥 → ∅ ∈ 𝑥)
32rgenw 2605 . . 3 ∀𝑥 ∈ 𝐴 (Ind 𝑥 → ∅ ∈ 𝑥)
4 0ex 4260 . . . 4 ∅ ∈ V
54elintrab 3982 . . 3 (∅ ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥} ↔ ∀𝑥 ∈ 𝐴 (Ind 𝑥 → ∅ ∈ 𝑥))
63, 5mpbir 146 . 2 ∅ ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥}
7 bj-indsuc 17120 . . . . . 6 (Ind 𝑥 → (𝑦 ∈ 𝑥 → suc 𝑦 ∈ 𝑥))
87a2i 11 . . . . 5 ((Ind 𝑥 → 𝑦 ∈ 𝑥) → (Ind 𝑥 → suc 𝑦 ∈ 𝑥))
98ralimi 2613 . . . 4 (∀𝑥 ∈ 𝐴 (Ind 𝑥 → 𝑦 ∈ 𝑥) → ∀𝑥 ∈ 𝐴 (Ind 𝑥 → suc 𝑦 ∈ 𝑥))
10 vex 2824 . . . . 5 𝑦 ∈ V
1110elintrab 3982 . . . 4 (𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥} ↔ ∀𝑥 ∈ 𝐴 (Ind 𝑥 → 𝑦 ∈ 𝑥))
1210bj-sucex 17115 . . . . 5 suc 𝑦 ∈ V
1312elintrab 3982 . . . 4 (suc 𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥} ↔ ∀𝑥 ∈ 𝐴 (Ind 𝑥 → suc 𝑦 ∈ 𝑥))
149, 11, 133imtr4i 201 . . 3 (𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥} → suc 𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥})
1514rgen 2603 . 2 ∀𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥}suc 𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥}
16 df-bj-ind 17119 . 2 (Ind ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥} ↔ (∅ ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥} ∧ ∀𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥}suc 𝑦 ∈ ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥}))
176, 15, 16mpbir2an 955 1 Ind ∩ {𝑥 ∈ 𝐴 ∣ Ind 𝑥}
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2209  ∀wral 2528  {crab 2532  ∅c0 3520  ∩ cint 3970  suc csuc 4510  Ind wind 17118
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-14 2212  ax-ext 2220  ax-nul 4259  ax-pr 4346  ax-un 4578  ax-bd0 17005  ax-bdor 17008  ax-bdex 17011  ax-bdeq 17012  ax-bdel 17013  ax-bdsep 17076
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-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-nul 3521  df-sn 3715  df-pr 3716  df-uni 3936  df-int 3971  df-suc 4516  df-bj-ind 17119
This theorem is used by:  bj-omind  17126
  Copyright terms: Public domain W3C validator