| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvralvw | GIF version | ||
| Description: Version of cbvralv 2778 with a disjoint variable condition. (Contributed by GG, 10-Jan-2024.) Reduce axiom usage. (Revised by GG, 25-Aug-2024.) |
| Ref | Expression |
|---|---|
| cbvralvw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| cbvralvw | ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ 𝐴 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1w 2293 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 2 | cbvralvw.1 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | imbi12d 234 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑦 ∈ 𝐴 → 𝜓))) |
| 4 | 3 | cbvalvw 1969 | . 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓)) |
| 5 | df-ral 2525 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
| 6 | df-ral 2525 | . 2 ⊢ (∀𝑦 ∈ 𝐴 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓)) | |
| 7 | 4, 5, 6 | 3bitr4i 212 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ 𝐴 𝜓) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wal 1396 ∈ wcel 2203 ∀wral 2520 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1496 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-clel 2228 df-ral 2525 |
| This theorem is referenced by: cbvral2vw 2789 cc1 7579 zsupssdc 10598 hashfibc 11207 wrdind 11414 wrd2ind 11415 reuccatpfxs1 11439 prmpwdvds 13053 nninfdclemcl 13199 grpinvalem 13598 grpinva 13599 issubg4m 13910 isnsg2 13920 elnmz 13925 fsumdvdsmul 15859 2sqlem6 15993 2sqlem10 15998 uspgr2wlkeq 16360 depindlem1 16501 bj-charfunbi 16581 |
| Copyright terms: Public domain | W3C validator |