Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > rngmgmbs4 | Structured version Visualization version GIF version |
Description: The range of an internal operation with a left and right identity element equals its base set. (Contributed by FL, 24-Jan-2010.) (Revised by Mario Carneiro, 22-Dec-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
rngmgmbs4 | ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → ran 𝐺 = 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.12 3234 | . . . . 5 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) | |
2 | simpl 486 | . . . . . . . . 9 ⊢ (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → (𝑢𝐺𝑥) = 𝑥) | |
3 | 2 | eqcomd 2744 | . . . . . . . 8 ⊢ (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → 𝑥 = (𝑢𝐺𝑥)) |
4 | oveq2 7178 | . . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑢𝐺𝑦) = (𝑢𝐺𝑥)) | |
5 | 4 | rspceeqv 3541 | . . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 = (𝑢𝐺𝑥)) → ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)) |
6 | 5 | ex 416 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → (𝑥 = (𝑢𝐺𝑥) → ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))) |
7 | 3, 6 | syl5 34 | . . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))) |
8 | 7 | reximdv 3183 | . . . . . 6 ⊢ (𝑥 ∈ 𝑋 → (∃𝑢 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))) |
9 | 8 | ralimia 3073 | . . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)) |
10 | 1, 9 | syl 17 | . . . 4 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)) |
11 | 10 | anim2i 620 | . . 3 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))) |
12 | foov 7338 | . . 3 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))) | |
13 | 11, 12 | sylibr 237 | . 2 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → 𝐺:(𝑋 × 𝑋)–onto→𝑋) |
14 | forn 6595 | . 2 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 → ran 𝐺 = 𝑋) | |
15 | 13, 14 | syl 17 | 1 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → ran 𝐺 = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1542 ∈ wcel 2114 ∀wral 3053 ∃wrex 3054 × cxp 5523 ran crn 5526 ⟶wf 6335 –onto→wfo 6337 (class class class)co 7170 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-sep 5167 ax-nul 5174 ax-pr 5296 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ral 3058 df-rex 3059 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-nul 4212 df-if 4415 df-sn 4517 df-pr 4519 df-op 4523 df-uni 4797 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5429 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-fo 6345 df-fv 6347 df-ov 7173 |
This theorem is referenced by: rngorn1eq 35715 |
Copyright terms: Public domain | W3C validator |