| 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 50623 | . 2 ⊢ (∀∃𝑥(𝑥 ∈ 𝐴 → ∀∃𝑦(𝑦 ∈ 𝐴 → 𝜑)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ (𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅))) | |
| 2 | pm4.24 573 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ (𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅)) | |
| 3 | 2 | bicomi 227 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅) ↔ 𝐴 ≠ ∅) |
| 4 | 3 | anbi2i 634 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ (𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ 𝐴 ≠ ∅)) |
| 5 | 1, 4 | bitri 278 | 1 ⊢ (∀∃𝑥(𝑥 ∈ 𝐴 → ∀∃𝑦(𝑦 ∈ 𝐴 → 𝜑)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ 𝐴 ≠ ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 400 ∈ wcel 2142 ≠ wne 2957 ∀wral 3078 ∅c0 4285 ∀∃wals 50592 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-9 2152 ax-12 2212 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-clab 2741 df-cleq 2754 df-ne 2958 df-ral 3079 df-rex 3089 df-dif 3907 df-nul 4286 df-als 50594 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |