Theorem bj-ssom 16071

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 3915	. . 3 ⊢ (𝐴 ⊆ ∩ {𝑦 ∣ Ind 𝑦} ↔ ∀𝑥 ∈ {𝑦 ∣ Ind 𝑦}𝐴 ⊆ 𝑥)
2		df-ral 2491	. . 3 ⊢ (∀𝑥 ∈ {𝑦 ∣ Ind 𝑦}𝐴 ⊆ 𝑥 ↔ ∀𝑥(𝑥 ∈ {𝑦 ∣ Ind 𝑦} → 𝐴 ⊆ 𝑥))
3		vex 2779	. . . . . 6 ⊢ 𝑥 ∈ V
4		bj-indeq 16064	. . . . . 6 ⊢ (𝑦 = 𝑥 → (Ind 𝑦 ↔ Ind 𝑥))
5	3, 4	elab 2924	. . . . 5 ⊢ (𝑥 ∈ {𝑦 ∣ Ind 𝑦} ↔ Ind 𝑥)
6	5	imbi1i 238	. . . 4 ⊢ ((𝑥 ∈ {𝑦 ∣ Ind 𝑦} → 𝐴 ⊆ 𝑥) ↔ (Ind 𝑥 → 𝐴 ⊆ 𝑥))
7	6	albii 1494	. . 3 ⊢ (∀𝑥(𝑥 ∈ {𝑦 ∣ Ind 𝑦} → 𝐴 ⊆ 𝑥) ↔ ∀𝑥(Ind 𝑥 → 𝐴 ⊆ 𝑥))
8	1, 2, 7	3bitrri 207	. 2 ⊢ (∀𝑥(Ind 𝑥 → 𝐴 ⊆ 𝑥) ↔ 𝐴 ⊆ ∩ {𝑦 ∣ Ind 𝑦})
9		bj-dfom 16068	. . . 4 ⊢ ω = ∩ {𝑦 ∣ Ind 𝑦}
10	9	eqcomi 2211	. . 3 ⊢ ∩ {𝑦 ∣ Ind 𝑦} = ω
11	10	sseq2i 3228	. 2 ⊢ (𝐴 ⊆ ∩ {𝑦 ∣ Ind 𝑦} ↔ 𝐴 ⊆ ω)
12	8, 11	bitri 184	1 ⊢ (∀𝑥(Ind 𝑥 → 𝐴 ⊆ 𝑥) ↔ 𝐴 ⊆ ω)

Syntax hints:   → wi 4   ↔ wb 105  ∀wal 1371   ∈ wcel 2178  {cab 2193  ∀wral 2486   ⊆ wss 3174  ∩ cint 3899  ωcom 4656  Ind wind 16061

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-v 2778  df-in 3180  df-ss 3187  df-int 3900  df-iom 4657  df-bj-ind 16062

This theorem is referenced by:  bj-om  16072