| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dibvalrel | Structured version Visualization version GIF version | ||
| Description: The value of partial isomorphism B is a relation. (Contributed by NM, 8-Mar-2014.) |
| Ref | Expression |
|---|---|
| dibcl.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dibcl.i | ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| dibvalrel | ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → Rel (𝐼‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relxp 5673 | . . 3 ⊢ Rel ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))}) | |
| 2 | dibcl.h | . . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 3 | eqid 2760 | . . . . . . . 8 ⊢ ((DIsoA‘𝐾)‘𝑊) = ((DIsoA‘𝐾)‘𝑊) | |
| 4 | dibcl.i | . . . . . . . 8 ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) | |
| 5 | 2, 3, 4 | dibdiadm 42028 | . . . . . . 7 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → dom 𝐼 = dom ((DIsoA‘𝐾)‘𝑊)) |
| 6 | 5 | eleq2d 2846 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑋 ∈ dom 𝐼 ↔ 𝑋 ∈ dom ((DIsoA‘𝐾)‘𝑊))) |
| 7 | 6 | biimpa 482 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ dom ((DIsoA‘𝐾)‘𝑊)) |
| 8 | eqid 2760 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 9 | eqid 2760 | . . . . . 6 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊) | |
| 10 | eqid 2760 | . . . . . 6 ⊢ (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾))) = (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾))) | |
| 11 | 8, 2, 9, 10, 3, 4 | dibval 42015 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom ((DIsoA‘𝐾)‘𝑊)) → (𝐼‘𝑋) = ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))})) |
| 12 | 7, 11 | syldan 603 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → (𝐼‘𝑋) = ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))})) |
| 13 | 12 | releqd 5759 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → (Rel (𝐼‘𝑋) ↔ Rel ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))}))) |
| 14 | 1, 13 | mpbiri 261 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → Rel (𝐼‘𝑋)) |
| 15 | rel0 5779 | . . . 4 ⊢ Rel ∅ | |
| 16 | ndmfv 6910 | . . . . 5 ⊢ (¬ 𝑋 ∈ dom 𝐼 → (𝐼‘𝑋) = ∅) | |
| 17 | 16 | releqd 5759 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐼 → (Rel (𝐼‘𝑋) ↔ Rel ∅)) |
| 18 | 15, 17 | mpbiri 261 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐼 → Rel (𝐼‘𝑋)) |
| 19 | 18 | adantl 487 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ ¬ 𝑋 ∈ dom 𝐼) → Rel (𝐼‘𝑋)) |
| 20 | 14, 19 | pm2.61dan 825 | 1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → Rel (𝐼‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∅c0 4279 {csn 4584 ↦ cmpt 5186 I cid 5549 × cxp 5653 dom cdm 5655 ↾ cres 5657 Rel wrel 5660 ‘cfv 6533 Basecbs 17301 LHypclh 40857 LTrncltrn 40974 DIsoAcdia 41901 DIsoBcdib 42011 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-dib 42012 |
| This theorem is used by: dibglbN 42039 dib2dim 42116 dih2dimbALTN 42118 |
| Copyright terms: Public domain | W3C validator |