| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvralvw | GIF version | ||
| Description: Version of cbvralv 2765 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 2290 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 2 | cbvralvw.1 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | imbi12d 234 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑦 ∈ 𝐴 → 𝜓))) |
| 4 | 3 | cbvalvw 1966 | . 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓)) |
| 5 | df-ral 2513 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
| 6 | df-ral 2513 | . 2 ⊢ (∀𝑦 ∈ 𝐴 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓)) | |
| 7 | 4, 5, 6 | 3bitr4i 212 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ 𝐴 𝜓) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wal 1393 ∈ wcel 2200 ∀wral 2508 |
| 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 1493 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 |
| This theorem depends on definitions: df-bi 117 df-nf 1507 df-clel 2225 df-ral 2513 |
| This theorem is referenced by: cbvral2vw 2776 cc1 7447 zsupssdc 10453 wrdind 11249 wrd2ind 11250 reuccatpfxs1 11274 prmpwdvds 12873 nninfdclemcl 13014 grpinvalem 13413 grpinva 13414 issubg4m 13725 isnsg2 13735 elnmz 13740 fsumdvdsmul 15659 2sqlem6 15793 2sqlem10 15798 bj-charfunbi 16132 |
| Copyright terms: Public domain | W3C validator |