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 487 | . . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 𝐵 = 𝐷) | |
2 | simpl 485 | . . . . . . 7 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 𝐴 = 𝐶) | |
3 | 2 | sneqd 4582 | . . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴} = {𝐶}) |
4 | 1, 3 | imaeq12d 5933 | . . . . 5 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐵 “ {𝐴}) = (𝐷 “ {𝐶})) |
5 | 4 | eleq2d 2901 | . . . 4 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ({𝑥} ∈ (𝐵 “ {𝐴}) ↔ {𝑥} ∈ (𝐷 “ {𝐶}))) |
6 | 5 | abbidv 2888 | . . 3 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝑥 ∣ {𝑥} ∈ (𝐵 “ {𝐴})} = {𝑥 ∣ {𝑥} ∈ (𝐷 “ {𝐶})}) |
7 | df-bj-proj 34307 | . . 3 ⊢ (𝐴 Proj 𝐵) = {𝑥 ∣ {𝑥} ∈ (𝐵 “ {𝐴})} | |
8 | df-bj-proj 34307 | . . 3 ⊢ (𝐶 Proj 𝐷) = {𝑥 ∣ {𝑥} ∈ (𝐷 “ {𝐶})} | |
9 | 6, 7, 8 | 3eqtr4g 2884 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐴 Proj 𝐵) = (𝐶 Proj 𝐷)) |
10 | 9 | ex 415 | 1 ⊢ (𝐴 = 𝐶 → (𝐵 = 𝐷 → (𝐴 Proj 𝐵) = (𝐶 Proj 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 {cab 2802 {csn 4570 “ cima 5561 Proj bj-cproj 34306 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-br 5070 df-opab 5132 df-xp 5564 df-cnv 5566 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-bj-proj 34307 |
This theorem is referenced by: bj-projeq2 34309 |
Copyright terms: Public domain | W3C validator |