| 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 9809. (Contributed by Scott Fenton, 15-Jul-2015.) |
| Ref | Expression |
|---|---|
| rankung | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uneq1 4114 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∪ 𝑦) = (𝐴 ∪ 𝑦)) | |
| 2 | 1 | fveq2d 6865 | . . 3 ⊢ (𝑥 = 𝐴 → (rank‘(𝑥 ∪ 𝑦)) = (rank‘(𝐴 ∪ 𝑦))) |
| 3 | fveq2 6861 | . . . 4 ⊢ (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴)) | |
| 4 | 3 | uneq1d 4120 | . . 3 ⊢ (𝑥 = 𝐴 → ((rank‘𝑥) ∪ (rank‘𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦))) |
| 5 | 2, 4 | eqeq12d 2777 | . 2 ⊢ (𝑥 = 𝐴 → ((rank‘(𝑥 ∪ 𝑦)) = ((rank‘𝑥) ∪ (rank‘𝑦)) ↔ (rank‘(𝐴 ∪ 𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦)))) |
| 6 | uneq2 4115 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴 ∪ 𝑦) = (𝐴 ∪ 𝐵)) | |
| 7 | 6 | fveq2d 6865 | . . 3 ⊢ (𝑦 = 𝐵 → (rank‘(𝐴 ∪ 𝑦)) = (rank‘(𝐴 ∪ 𝐵))) |
| 8 | fveq2 6861 | . . . 4 ⊢ (𝑦 = 𝐵 → (rank‘𝑦) = (rank‘𝐵)) | |
| 9 | 8 | uneq2d 4121 | . . 3 ⊢ (𝑦 = 𝐵 → ((rank‘𝐴) ∪ (rank‘𝑦)) = ((rank‘𝐴) ∪ (rank‘𝐵))) |
| 10 | 7, 9 | eqeq12d 2777 | . 2 ⊢ (𝑦 = 𝐵 → ((rank‘(𝐴 ∪ 𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦)) ↔ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)))) |
| 11 | vex 3457 | . . 3 ⊢ 𝑥 ∈ V | |
| 12 | vex 3457 | . . 3 ⊢ 𝑦 ∈ V | |
| 13 | 11, 12 | rankun 9809 | . 2 ⊢ (rank‘(𝑥 ∪ 𝑦)) = ((rank‘𝑥) ∪ (rank‘𝑦)) |
| 14 | 5, 10, 13 | vtocl2g 3538 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∪ cun 3902 ‘cfv 6515 rankcrnk 9716 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-reg 9535 ax-inf2 9591 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-ov 7393 df-om 7841 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-r1 9717 df-rank 9718 |
| This theorem is referenced by: hfun 36481 |
| Copyright terms: Public domain | W3C validator |