| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rankung | Structured version Visualization version GIF version | ||
| Description: The rank of the union of two sets. Closed form of rankun 9741. (Contributed by Scott Fenton, 15-Jul-2015.) |
| Ref | Expression |
|---|---|
| rankung | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uneq1 4109 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∪ 𝑦) = (𝐴 ∪ 𝑦)) | |
| 2 | 1 | fveq2d 6821 | . . 3 ⊢ (𝑥 = 𝐴 → (rank‘(𝑥 ∪ 𝑦)) = (rank‘(𝐴 ∪ 𝑦))) |
| 3 | fveq2 6817 | . . . 4 ⊢ (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴)) | |
| 4 | 3 | uneq1d 4115 | . . 3 ⊢ (𝑥 = 𝐴 → ((rank‘𝑥) ∪ (rank‘𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦))) |
| 5 | 2, 4 | eqeq12d 2746 | . 2 ⊢ (𝑥 = 𝐴 → ((rank‘(𝑥 ∪ 𝑦)) = ((rank‘𝑥) ∪ (rank‘𝑦)) ↔ (rank‘(𝐴 ∪ 𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦)))) |
| 6 | uneq2 4110 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴 ∪ 𝑦) = (𝐴 ∪ 𝐵)) | |
| 7 | 6 | fveq2d 6821 | . . 3 ⊢ (𝑦 = 𝐵 → (rank‘(𝐴 ∪ 𝑦)) = (rank‘(𝐴 ∪ 𝐵))) |
| 8 | fveq2 6817 | . . . 4 ⊢ (𝑦 = 𝐵 → (rank‘𝑦) = (rank‘𝐵)) | |
| 9 | 8 | uneq2d 4116 | . . 3 ⊢ (𝑦 = 𝐵 → ((rank‘𝐴) ∪ (rank‘𝑦)) = ((rank‘𝐴) ∪ (rank‘𝐵))) |
| 10 | 7, 9 | eqeq12d 2746 | . 2 ⊢ (𝑦 = 𝐵 → ((rank‘(𝐴 ∪ 𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦)) ↔ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)))) |
| 11 | vex 3438 | . . 3 ⊢ 𝑥 ∈ V | |
| 12 | vex 3438 | . . 3 ⊢ 𝑦 ∈ V | |
| 13 | 11, 12 | rankun 9741 | . 2 ⊢ (rank‘(𝑥 ∪ 𝑦)) = ((rank‘𝑥) ∪ (rank‘𝑦)) |
| 14 | 5, 10, 13 | vtocl2g 3527 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2110 ∪ cun 3898 ‘cfv 6477 rankcrnk 9648 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-reg 9473 ax-inf2 9526 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-int 4896 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-ov 7344 df-om 7792 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-r1 9649 df-rank 9650 |
| This theorem is referenced by: hfun 36191 |
| Copyright terms: Public domain | W3C validator |