![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > isfin1a | Structured version Visualization version GIF version |
Description: Definition of a Ia-finite set. (Contributed by Stefan O'Rear, 16-May-2015.) |
Ref | Expression |
---|---|
isfin1a | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ FinIa ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴 ∖ 𝑦) ∈ Fin))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pweq 4636 | . . 3 ⊢ (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴) | |
2 | difeq1 4142 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∖ 𝑦) = (𝐴 ∖ 𝑦)) | |
3 | 2 | eleq1d 2829 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∖ 𝑦) ∈ Fin ↔ (𝐴 ∖ 𝑦) ∈ Fin)) |
4 | 3 | orbi2d 914 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑦 ∈ Fin ∨ (𝑥 ∖ 𝑦) ∈ Fin) ↔ (𝑦 ∈ Fin ∨ (𝐴 ∖ 𝑦) ∈ Fin))) |
5 | 1, 4 | raleqbidv 3354 | . 2 ⊢ (𝑥 = 𝐴 → (∀𝑦 ∈ 𝒫 𝑥(𝑦 ∈ Fin ∨ (𝑥 ∖ 𝑦) ∈ Fin) ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴 ∖ 𝑦) ∈ Fin))) |
6 | df-fin1a 10354 | . 2 ⊢ FinIa = {𝑥 ∣ ∀𝑦 ∈ 𝒫 𝑥(𝑦 ∈ Fin ∨ (𝑥 ∖ 𝑦) ∈ Fin)} | |
7 | 5, 6 | elab2g 3696 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ FinIa ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴 ∖ 𝑦) ∈ Fin))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∨ wo 846 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ∖ cdif 3973 𝒫 cpw 4622 Fincfn 9003 FinIacfin1a 10347 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rab 3444 df-v 3490 df-dif 3979 df-ss 3993 df-pw 4624 df-fin1a 10354 |
This theorem is referenced by: fin1ai 10362 fin11a 10452 enfin1ai 10453 |
Copyright terms: Public domain | W3C validator |