Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-projeq | Structured version Visualization version GIF version |
Description: Substitution property for Proj. (Contributed by BJ, 6-Apr-2019.) |
Ref | Expression |
---|---|
bj-projeq | ⊢ (𝐴 = 𝐶 → (𝐵 = 𝐷 → (𝐴 Proj 𝐵) = (𝐶 Proj 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 484 | . . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 𝐵 = 𝐷) | |
2 | simpl 482 | . . . . . . 7 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 𝐴 = 𝐶) | |
3 | 2 | sneqd 4570 | . . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴} = {𝐶}) |
4 | 1, 3 | imaeq12d 5959 | . . . . 5 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐵 “ {𝐴}) = (𝐷 “ {𝐶})) |
5 | 4 | eleq2d 2824 | . . . 4 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ({𝑥} ∈ (𝐵 “ {𝐴}) ↔ {𝑥} ∈ (𝐷 “ {𝐶}))) |
6 | 5 | abbidv 2808 | . . 3 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝑥 ∣ {𝑥} ∈ (𝐵 “ {𝐴})} = {𝑥 ∣ {𝑥} ∈ (𝐷 “ {𝐶})}) |
7 | df-bj-proj 35108 | . . 3 ⊢ (𝐴 Proj 𝐵) = {𝑥 ∣ {𝑥} ∈ (𝐵 “ {𝐴})} | |
8 | df-bj-proj 35108 | . . 3 ⊢ (𝐶 Proj 𝐷) = {𝑥 ∣ {𝑥} ∈ (𝐷 “ {𝐶})} | |
9 | 6, 7, 8 | 3eqtr4g 2804 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐴 Proj 𝐵) = (𝐶 Proj 𝐷)) |
10 | 9 | ex 412 | 1 ⊢ (𝐴 = 𝐶 → (𝐵 = 𝐷 → (𝐴 Proj 𝐵) = (𝐶 Proj 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {cab 2715 {csn 4558 “ cima 5583 Proj bj-cproj 35107 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-xp 5586 df-cnv 5588 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-bj-proj 35108 |
This theorem is referenced by: bj-projeq2 35110 |
Copyright terms: Public domain | W3C validator |