| Mathbox for David A. Wheeler |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 2alsraln0id | Structured version Visualization version GIF version | ||
| Description: Nested general "all some" quantifiers with class membership as their antecedents, for the same class 𝐴: 𝜑 holds for every 𝑥 and every 𝑦 in 𝐴, and 𝐴 is not empty. (Contributed by Peter Mazsa, 28-May-2019.) (Revised by David A. Wheeler, 15-Jul-2026.) |
| Ref | Expression |
|---|---|
| 2alsraln0id | ⊢ (∀∃𝑥(𝑥 ∈ 𝐴 → ∀∃𝑦(𝑦 ∈ 𝐴 → 𝜑)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ 𝐴 ≠ ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2alsraln0 50913 | . 2 ⊢ (∀∃𝑥(𝑥 ∈ 𝐴 → ∀∃𝑦(𝑦 ∈ 𝐴 → 𝜑)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ (𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅))) | |
| 2 | pm4.24 574 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ (𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅)) | |
| 3 | 2 | bicomi 227 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅) ↔ 𝐴 ≠ ∅) |
| 4 | 3 | anbi2i 635 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ (𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ 𝐴 ≠ ∅)) |
| 5 | 1, 4 | bitri 278 | 1 ⊢ (∀∃𝑥(𝑥 ∈ 𝐴 → ∀∃𝑦(𝑦 ∈ 𝐴 → 𝜑)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ 𝐴 ≠ ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∈ wcel 2144 ≠ wne 2955 ∀wral 3076 ∅c0 4278 ∀∃wals 50882 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-9 2154 ax-12 2212 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-clab 2739 df-cleq 2752 df-ne 2956 df-ral 3077 df-rex 3087 df-dif 4047 df-nul 4279 df-als 50884 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |