| 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 488 | . . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 𝐵 = 𝐷) | |
| 2 | simpl 486 | . . . . . . 7 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 𝐴 = 𝐶) | |
| 3 | 2 | sneqd 4594 | . . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴} = {𝐶}) |
| 4 | 1, 3 | imaeq12d 6050 | . . . . 5 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐵 “ {𝐴}) = (𝐷 “ {𝐶})) |
| 5 | 4 | eleq2d 2848 | . . . 4 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ({𝑥} ∈ (𝐵 “ {𝐴}) ↔ {𝑥} ∈ (𝐷 “ {𝐶}))) |
| 6 | 5 | abbidv 2828 | . . 3 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝑥 ∣ {𝑥} ∈ (𝐵 “ {𝐴})} = {𝑥 ∣ {𝑥} ∈ (𝐷 “ {𝐶})}) |
| 7 | df-bj-proj 37476 | . . 3 ⊢ (𝐴 Proj 𝐵) = {𝑥 ∣ {𝑥} ∈ (𝐵 “ {𝐴})} | |
| 8 | df-bj-proj 37476 | . . 3 ⊢ (𝐶 Proj 𝐷) = {𝑥 ∣ {𝑥} ∈ (𝐷 “ {𝐶})} | |
| 9 | 6, 7, 8 | 3eqtr4g 2822 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐴 Proj 𝐵) = (𝐶 Proj 𝐷)) |
| 10 | 9 | ex 416 | 1 ⊢ (𝐴 = 𝐶 → (𝐵 = 𝐷 → (𝐴 Proj 𝐵) = (𝐶 Proj 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 {cab 2740 {csn 4582 “ cima 5650 Proj bj-cproj 37475 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5653 df-cnv 5655 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-bj-proj 37476 |
| This theorem is referenced by: bj-projeq2 37478 |
| Copyright terms: Public domain | W3C validator |