| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brmptiunrelexpd | Structured version Visualization version GIF version | ||
| Description: If two elements are connected by an indexed union of relational powers, then they are connected via 𝑛 instances the relation, for some 𝑛. Generalization of dfrtrclrec2 15178. (Contributed by RP, 21-Jul-2020.) |
| Ref | Expression |
|---|---|
| brmptiunrelexpd.c | ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) |
| brmptiunrelexpd.r | ⊢ (𝜑 → 𝑅 ∈ V) |
| brmptiunrelexpd.n | ⊢ (𝜑 → 𝑁 ⊆ ℕ0) |
| Ref | Expression |
|---|---|
| brmptiunrelexpd | ⊢ (𝜑 → (𝐴(𝐶‘𝑅)𝐵 ↔ ∃𝑛 ∈ 𝑁 𝐴(𝑅↑𝑟𝑛)𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brmptiunrelexpd.r | . 2 ⊢ (𝜑 → 𝑅 ∈ V) | |
| 2 | brmptiunrelexpd.n | . . 3 ⊢ (𝜑 → 𝑁 ⊆ ℕ0) | |
| 3 | nn0ex 12581 | . . . 4 ⊢ ℕ0 ∈ V | |
| 4 | 3 | ssex 5281 | . . 3 ⊢ (𝑁 ⊆ ℕ0 → 𝑁 ∈ V) |
| 5 | 2, 4 | syl 18 | . 2 ⊢ (𝜑 → 𝑁 ∈ V) |
| 6 | brmptiunrelexpd.c | . . 3 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) | |
| 7 | 6 | briunov2 44626 | . 2 ⊢ ((𝑅 ∈ V ∧ 𝑁 ∈ V) → (𝐴(𝐶‘𝑅)𝐵 ↔ ∃𝑛 ∈ 𝑁 𝐴(𝑅↑𝑟𝑛)𝐵)) |
| 8 | 1, 5, 7 | syl2anc 596 | 1 ⊢ (𝜑 → (𝐴(𝐶‘𝑅)𝐵 ↔ ∃𝑛 ∈ 𝑁 𝐴(𝑅↑𝑟𝑛)𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 Vcvv 3450 ⊆ wss 3898 ∪ ciun 4950 class class class wbr 5102 ↦ cmpt 5185 ‘cfv 6527 (class class class)co 7408 ℕ0cn0 12575 ↑𝑟crelexp 15139 |
| 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 5231 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-1cn 11229 ax-addcl 11231 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-om 7861 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-nn 12305 df-n0 12576 |
| This theorem is used by: brfvidRP 44632 brfvrcld 44635 brfvtrcld 44665 brfvrtrcld 44678 |
| Copyright terms: Public domain | W3C validator |