Theorem bj-ssom 17133

Description: A characterization of subclasses of ω. (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-ssom	⊢ (∀𝑥(Ind 𝑥 → 𝐴 ⊆ 𝑥) ↔ 𝐴 ⊆ ω)

Distinct variable group:   𝑥,𝐴

Proof of Theorem bj-ssom

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssint 3986	. . 3 ⊢ (𝐴 ⊆ ∩ {𝑦 ∣ Ind 𝑦} ↔ ∀𝑥 ∈ {𝑦 ∣ Ind 𝑦}𝐴 ⊆ 𝑥)
2		df-ral 2533	. . 3 ⊢ (∀𝑥 ∈ {𝑦 ∣ Ind 𝑦}𝐴 ⊆ 𝑥 ↔ ∀𝑥(𝑥 ∈ {𝑦 ∣ Ind 𝑦} → 𝐴 ⊆ 𝑥))
3		vex 2824	. . . . . 6 ⊢ 𝑥 ∈ V
4		bj-indeq 17126	. . . . . 6 ⊢ (𝑦 = 𝑥 → (Ind 𝑦 ↔ Ind 𝑥))
5	3, 4	elab 2970	. . . . 5 ⊢ (𝑥 ∈ {𝑦 ∣ Ind 𝑦} ↔ Ind 𝑥)
6	5	imbi1i 238	. . . 4 ⊢ ((𝑥 ∈ {𝑦 ∣ Ind 𝑦} → 𝐴 ⊆ 𝑥) ↔ (Ind 𝑥 → 𝐴 ⊆ 𝑥))
7	6	albii 1523	. . 3 ⊢ (∀𝑥(𝑥 ∈ {𝑦 ∣ Ind 𝑦} → 𝐴 ⊆ 𝑥) ↔ ∀𝑥(Ind 𝑥 → 𝐴 ⊆ 𝑥))
8	1, 2, 7	3bitrri 207	. 2 ⊢ (∀𝑥(Ind 𝑥 → 𝐴 ⊆ 𝑥) ↔ 𝐴 ⊆ ∩ {𝑦 ∣ Ind 𝑦})
9		bj-dfom 17130	. . . 4 ⊢ ω = ∩ {𝑦 ∣ Ind 𝑦}
10	9	eqcomi 2242	. . 3 ⊢ ∩ {𝑦 ∣ Ind 𝑦} = ω
11	10	sseq2i 3275	. 2 ⊢ (𝐴 ⊆ ∩ {𝑦 ∣ Ind 𝑦} ↔ 𝐴 ⊆ ω)
12	8, 11	bitri 184	1 ⊢ (∀𝑥(Ind 𝑥 → 𝐴 ⊆ 𝑥) ↔ 𝐴 ⊆ ω)

This proof depends on syntax axioms:   → wi 4   ↔ wb 105  ∀wal 1400   ∈ wcel 2209  {cab 2224  ∀wral 2528   ⊆ wss 3220  ∩ cint 3970  ωcom 4737  Ind wind 17123

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-int 3971  df-iom 4738  df-bj-ind 17124

This theorem is used by:  bj-om  17134