Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rspc2vd | GIF version |
Description: Deduction version of 2-variable restricted specialization, using implicit substitution. Notice that the class 𝐷 for the second set variable 𝑦 may depend on the first set variable 𝑥. (Contributed by AV, 29-Mar-2021.) |
Ref | Expression |
---|---|
rspc2vd.a | ⊢ (𝑥 = 𝐴 → (𝜃 ↔ 𝜒)) |
rspc2vd.b | ⊢ (𝑦 = 𝐵 → (𝜒 ↔ 𝜓)) |
rspc2vd.c | ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
rspc2vd.d | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐷 = 𝐸) |
rspc2vd.e | ⊢ (𝜑 → 𝐵 ∈ 𝐸) |
Ref | Expression |
---|---|
rspc2vd | ⊢ (𝜑 → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐷 𝜃 → 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rspc2vd.e | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝐸) | |
2 | rspc2vd.c | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐶) | |
3 | rspc2vd.d | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐷 = 𝐸) | |
4 | 2, 3 | csbied 3095 | . . 3 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐷 = 𝐸) |
5 | 1, 4 | eleqtrrd 2250 | . 2 ⊢ (𝜑 → 𝐵 ∈ ⦋𝐴 / 𝑥⦌𝐷) |
6 | nfcsb1v 3082 | . . . . 5 ⊢ Ⅎ𝑥⦋𝐴 / 𝑥⦌𝐷 | |
7 | nfv 1521 | . . . . 5 ⊢ Ⅎ𝑥𝜒 | |
8 | 6, 7 | nfralw 2507 | . . . 4 ⊢ Ⅎ𝑥∀𝑦 ∈ ⦋ 𝐴 / 𝑥⦌𝐷𝜒 |
9 | csbeq1a 3058 | . . . . 5 ⊢ (𝑥 = 𝐴 → 𝐷 = ⦋𝐴 / 𝑥⦌𝐷) | |
10 | rspc2vd.a | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜃 ↔ 𝜒)) | |
11 | 9, 10 | raleqbidv 2677 | . . . 4 ⊢ (𝑥 = 𝐴 → (∀𝑦 ∈ 𝐷 𝜃 ↔ ∀𝑦 ∈ ⦋ 𝐴 / 𝑥⦌𝐷𝜒)) |
12 | 8, 11 | rspc 2828 | . . 3 ⊢ (𝐴 ∈ 𝐶 → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐷 𝜃 → ∀𝑦 ∈ ⦋ 𝐴 / 𝑥⦌𝐷𝜒)) |
13 | 2, 12 | syl 14 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐷 𝜃 → ∀𝑦 ∈ ⦋ 𝐴 / 𝑥⦌𝐷𝜒)) |
14 | rspc2vd.b | . . 3 ⊢ (𝑦 = 𝐵 → (𝜒 ↔ 𝜓)) | |
15 | 14 | rspcv 2830 | . 2 ⊢ (𝐵 ∈ ⦋𝐴 / 𝑥⦌𝐷 → (∀𝑦 ∈ ⦋ 𝐴 / 𝑥⦌𝐷𝜒 → 𝜓)) |
16 | 5, 13, 15 | sylsyld 58 | 1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐷 𝜃 → 𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1348 ∈ wcel 2141 ∀wral 2448 ⦋csb 3049 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-v 2732 df-sbc 2956 df-csb 3050 |
This theorem is referenced by: insubm 12703 |
Copyright terms: Public domain | W3C validator |