| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fvconstr | Structured version Visualization version GIF version | ||
| Description: Two ways of expressing 𝐴𝑅𝐵. (Contributed by Zhi Wang, 18-Sep-2024.) |
| Ref | Expression |
|---|---|
| fvconstr.1 | ⊢ (𝜑 → 𝐹 = (𝑅 × {𝑌})) |
| fvconstr.2 | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| fvconstr.3 | ⊢ (𝜑 → 𝑌 ≠ ∅) |
| Ref | Expression |
|---|---|
| fvconstr | ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐵) = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-br 5109 | . 2 ⊢ (𝐴𝑅𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑅) | |
| 2 | fvconstr.1 | . . . . . . 7 ⊢ (𝜑 → 𝐹 = (𝑅 × {𝑌})) | |
| 3 | 2 | oveqd 7429 | . . . . . 6 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐴(𝑅 × {𝑌})𝐵)) |
| 4 | df-ov 7415 | . . . . . 6 ⊢ (𝐴(𝑅 × {𝑌})𝐵) = ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) | |
| 5 | 3, 4 | eqtrdi 2813 | . . . . 5 ⊢ (𝜑 → (𝐴𝐹𝐵) = ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉)) |
| 6 | 5 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 〈𝐴, 𝐵〉 ∈ 𝑅) → (𝐴𝐹𝐵) = ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉)) |
| 7 | fvconstr.2 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 8 | fvconst2g 7200 | . . . . 5 ⊢ ((𝑌 ∈ 𝑉 ∧ 〈𝐴, 𝐵〉 ∈ 𝑅) → ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) = 𝑌) | |
| 9 | 7, 8 | sylan 591 | . . . 4 ⊢ ((𝜑 ∧ 〈𝐴, 𝐵〉 ∈ 𝑅) → ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) = 𝑌) |
| 10 | 6, 9 | eqtrd 2797 | . . 3 ⊢ ((𝜑 ∧ 〈𝐴, 𝐵〉 ∈ 𝑅) → (𝐴𝐹𝐵) = 𝑌) |
| 11 | simpr 489 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → (𝐴𝐹𝐵) = 𝑌) | |
| 12 | fvconstr.3 | . . . . . . 7 ⊢ (𝜑 → 𝑌 ≠ ∅) | |
| 13 | 12 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → 𝑌 ≠ ∅) |
| 14 | 11, 13 | eqnetrd 3024 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → (𝐴𝐹𝐵) ≠ ∅) |
| 15 | 5 | neeq1d 3016 | . . . . . 6 ⊢ (𝜑 → ((𝐴𝐹𝐵) ≠ ∅ ↔ ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) ≠ ∅)) |
| 16 | 15 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → ((𝐴𝐹𝐵) ≠ ∅ ↔ ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) ≠ ∅)) |
| 17 | 14, 16 | mpbid 235 | . . . 4 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) ≠ ∅) |
| 18 | dmxpss 6168 | . . . . 5 ⊢ dom (𝑅 × {𝑌}) ⊆ 𝑅 | |
| 19 | ndmfv 6913 | . . . . . 6 ⊢ (¬ 〈𝐴, 𝐵〉 ∈ dom (𝑅 × {𝑌}) → ((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) = ∅) | |
| 20 | 19 | necon1ai 2984 | . . . . 5 ⊢ (((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) ≠ ∅ → 〈𝐴, 𝐵〉 ∈ dom (𝑅 × {𝑌})) |
| 21 | 18, 20 | sselid 3934 | . . . 4 ⊢ (((𝑅 × {𝑌})‘〈𝐴, 𝐵〉) ≠ ∅ → 〈𝐴, 𝐵〉 ∈ 𝑅) |
| 22 | 17, 21 | syl 18 | . . 3 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → 〈𝐴, 𝐵〉 ∈ 𝑅) |
| 23 | 10, 22 | impbida 812 | . 2 ⊢ (𝜑 → (〈𝐴, 𝐵〉 ∈ 𝑅 ↔ (𝐴𝐹𝐵) = 𝑌)) |
| 24 | 1, 23 | bitrid 286 | 1 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐵) = 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 ∅c0 4285 {csn 4588 〈cop 4594 class class class wbr 5108 × cxp 5658 dom cdm 5660 ‘cfv 6536 (class class class)co 7412 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-ov 7415 |
| This theorem is used by: prsthinc 50270 prstchom2ALT 50370 |
| Copyright terms: Public domain | W3C validator |