| 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 4578 | . . 3 ⊢ (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴) | |
| 2 | difeq1 4074 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∖ 𝑦) = (𝐴 ∖ 𝑦)) | |
| 3 | 2 | eleq1d 2850 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∖ 𝑦) ∈ Fin ↔ (𝐴 ∖ 𝑦) ∈ Fin)) |
| 4 | 3 | orbi2d 929 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑦 ∈ Fin ∨ (𝑥 ∖ 𝑦) ∈ Fin) ↔ (𝑦 ∈ Fin ∨ (𝐴 ∖ 𝑦) ∈ Fin))) |
| 5 | 1, 4 | raleqbidv 3340 | . 2 ⊢ (𝑥 = 𝐴 → (∀𝑦 ∈ 𝒫 𝑥(𝑦 ∈ Fin ∨ (𝑥 ∖ 𝑦) ∈ Fin) ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴 ∖ 𝑦) ∈ Fin))) |
| 6 | df-fin1a 10284 | . 2 ⊢ FinIa = {𝑥 ∣ ∀𝑦 ∈ 𝒫 𝑥(𝑦 ∈ Fin ∨ (𝑥 ∖ 𝑦) ∈ Fin)} | |
| 7 | 5, 6 | elab2g 3641 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ FinIa ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴 ∖ 𝑦) ∈ Fin))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∨ wo 861 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∖ cdif 3903 𝒫 cpw 4564 Fincfn 8949 FinIacfin1a 10277 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rab 3419 df-v 3459 df-dif 3909 df-ss 3923 df-pw 4566 df-fin1a 10284 |
| This theorem is used by: fin1ai 10292 fin11a 10382 enfin1ai 10383 |
| Copyright terms: Public domain | W3C validator |