| Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > aks6d1c1p1rcl | Structured version Visualization version GIF version | ||
| Description: Reverse closure of the introspective relation. (Contributed by metakunt, 25-Apr-2025.) |
| Ref | Expression |
|---|---|
| aks6d1c1p1rcl.1 | ⊢ ∼ = {〈𝑒, 𝑓〉 ∣ (𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} |
| aks6d1c1p1rcl.2 | ⊢ (𝜑 → 𝐸 ∼ 𝐹) |
| Ref | Expression |
|---|---|
| aks6d1c1p1rcl | ⊢ (𝜑 → (𝐸 ∈ ℕ ∧ 𝐹 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | aks6d1c1p1rcl.2 | . 2 ⊢ (𝜑 → 𝐸 ∼ 𝐹) | |
| 2 | aks6d1c1p1rcl.1 | . . . . 5 ⊢ ∼ = {〈𝑒, 𝑓〉 ∣ (𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} | |
| 3 | df-3an 1101 | . . . . . 6 ⊢ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦))) ↔ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))) | |
| 4 | 3 | opabbii 5169 | . . . . 5 ⊢ {〈𝑒, 𝑓〉 ∣ (𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} = {〈𝑒, 𝑓〉 ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} |
| 5 | 2, 4 | eqtri 2787 | . . . 4 ⊢ ∼ = {〈𝑒, 𝑓〉 ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} |
| 6 | opabssxp 5741 | . . . 4 ⊢ {〈𝑒, 𝑓〉 ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} ⊆ (ℕ × 𝐵) | |
| 7 | 5, 6 | eqsstri 3984 | . . 3 ⊢ ∼ ⊆ (ℕ × 𝐵) |
| 8 | 7 | brel 5714 | . 2 ⊢ (𝐸 ∼ 𝐹 → (𝐸 ∈ ℕ ∧ 𝐹 ∈ 𝐵)) |
| 9 | 1, 8 | syl 17 | 1 ⊢ (𝜑 → (𝐸 ∈ ℕ ∧ 𝐹 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ∀wral 3078 class class class wbr 5102 {copab 5164 × cxp 5647 ‘cfv 6523 (class class class)co 7398 ℕcn 12212 PrimRoots cprimroots 42713 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5103 df-opab 5165 df-xp 5655 |
| This theorem is referenced by: aks6d1c1p3 42732 aks6d1c1p4 42733 aks6d1c1p5 42734 aks6d1c1p6 42736 aks6d1c1p8 42737 aks6d1c2lem3 42748 aks6d1c2lem4 42749 |
| Copyright terms: Public domain | W3C validator |