Theorem isfin6 10359

Description: Definition of a VI-finite set. (Contributed by Stefan O'Rear, 16-May-2015.)

Assertion

Ref	Expression
isfin6	⊢ (𝐴 ∈ FinVI ↔ (𝐴 ≺ 2o ∨ 𝐴 ≺ (𝐴 × 𝐴)))

Proof of Theorem isfin6

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-fin6 10349	. . 3 ⊢ FinVI = {𝑥 ∣ (𝑥 ≺ 2o ∨ 𝑥 ≺ (𝑥 × 𝑥))}
2	1	eleq2i 2853	. 2 ⊢ (𝐴 ∈ FinVI ↔ 𝐴 ∈ {𝑥 ∣ (𝑥 ≺ 2o ∨ 𝑥 ≺ (𝑥 × 𝑥))})
3		relsdom 8964	. . . . 5 ⊢ Rel ≺
4	3	brrelex1i 5707	. . . 4 ⊢ (𝐴 ≺ 2o → 𝐴 ∈ V)
5	3	brrelex1i 5707	. . . 4 ⊢ (𝐴 ≺ (𝐴 × 𝐴) → 𝐴 ∈ V)
6	4, 5	jaoi 871	. . 3 ⊢ ((𝐴 ≺ 2o ∨ 𝐴 ≺ (𝐴 × 𝐴)) → 𝐴 ∈ V)
7		breq1 5106	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ≺ 2o ↔ 𝐴 ≺ 2o))
8		id 23	. . . . 5 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
9	8	sqxpeqd 5683	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 × 𝑥) = (𝐴 × 𝐴))
10	8, 9	breq12d 5116	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ≺ (𝑥 × 𝑥) ↔ 𝐴 ≺ (𝐴 × 𝐴)))
11	7, 10	orbi12d 932	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ≺ 2o ∨ 𝑥 ≺ (𝑥 × 𝑥)) ↔ (𝐴 ≺ 2o ∨ 𝐴 ≺ (𝐴 × 𝐴))))
12	6, 11	elab3 3640	. 2 ⊢ (𝐴 ∈ {𝑥 ∣ (𝑥 ≺ 2o ∨ 𝑥 ≺ (𝑥 × 𝑥))} ↔ (𝐴 ≺ 2o ∨ 𝐴 ≺ (𝐴 × 𝐴)))
13	2, 12	bitri 278	1 ⊢ (𝐴 ∈ FinVI ↔ (𝐴 ≺ 2o ∨ 𝐴 ≺ (𝐴 × 𝐴)))

This proof depends on syntax axioms:   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2145  {cab 2739  Vcvv 3451   class class class wbr 5103   × cxp 5649  2_oc2o 8454   ≺ csdm 8956  Fin^VIcfin6 10342

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-dom 8959  df-sdom 8960  df-fin6 10349

This theorem is used by:  fin56  10452  fin67  10454